./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/test-hard1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/test-hard1.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 782f6af95152c43f9bba17dfd450d57dc3073723e35aa3f98da1f0b96067f4d1 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 03:09:48,984 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 03:09:48,986 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 03:09:49,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 03:09:49,021 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 03:09:49,022 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 03:09:49,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 03:09:49,024 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 03:09:49,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 03:09:49,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 03:09:49,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 03:09:49,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 03:09:49,027 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 03:09:49,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 03:09:49,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 03:09:49,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 03:09:49,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 03:09:49,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 03:09:49,032 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 03:09:49,033 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 03:09:49,034 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 03:09:49,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 03:09:49,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 03:09:49,036 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 03:09:49,038 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 03:09:49,038 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 03:09:49,039 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 03:09:49,039 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 03:09:49,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 03:09:49,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 03:09:49,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 03:09:49,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 03:09:49,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 03:09:49,043 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 03:09:49,043 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 03:09:49,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 03:09:49,044 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 03:09:49,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 03:09:49,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 03:09:49,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 03:09:49,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 03:09:49,047 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 03:09:49,082 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 03:09:49,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 03:09:49,092 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 03:09:49,093 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 03:09:49,093 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 03:09:49,094 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 03:09:49,094 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 03:09:49,094 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 03:09:49,095 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 03:09:49,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 03:09:49,096 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 03:09:49,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 03:09:49,096 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 03:09:49,096 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 03:09:49,096 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 03:09:49,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 03:09:49,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 03:09:49,097 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 03:09:49,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 03:09:49,097 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 03:09:49,097 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 03:09:49,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 03:09:49,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 03:09:49,098 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 03:09:49,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 03:09:49,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 03:09:49,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 03:09:49,099 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 03:09:49,099 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 03:09:49,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 03:09:49,099 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 03:09:49,100 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 03:09:49,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 03:09:49,100 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 03:09:49,100 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 782f6af95152c43f9bba17dfd450d57dc3073723e35aa3f98da1f0b96067f4d1 [2021-12-16 03:09:49,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 03:09:49,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 03:09:49,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 03:09:49,383 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 03:09:49,383 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 03:09:49,384 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-hard1.wvr.c [2021-12-16 03:09:49,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81b063797/c839af33c0fd454cb7af0afd64385b09/FLAG09fb5c76e [2021-12-16 03:09:49,775 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 03:09:49,776 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-hard1.wvr.c [2021-12-16 03:09:49,785 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81b063797/c839af33c0fd454cb7af0afd64385b09/FLAG09fb5c76e [2021-12-16 03:09:50,199 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81b063797/c839af33c0fd454cb7af0afd64385b09 [2021-12-16 03:09:50,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 03:09:50,202 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 03:09:50,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 03:09:50,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 03:09:50,207 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 03:09:50,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:09:50" (1/1) ... [2021-12-16 03:09:50,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26f40a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:09:50, skipping insertion in model container [2021-12-16 03:09:50,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:09:50" (1/1) ... [2021-12-16 03:09:50,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 03:09:50,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 03:09:50,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-hard1.wvr.c[3373,3386] [2021-12-16 03:09:50,421 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 03:09:50,428 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 03:09:50,472 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-hard1.wvr.c[3373,3386] [2021-12-16 03:09:50,475 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 03:09:50,488 INFO L208 MainTranslator]: Completed translation [2021-12-16 03:09:50,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:09:50 WrapperNode [2021-12-16 03:09:50,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 03:09:50,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 03:09:50,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 03:09:50,491 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 03:09:50,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:09:50" (1/1) ... [2021-12-16 03:09:50,509 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:09:50" (1/1) ... [2021-12-16 03:09:50,547 INFO L137 Inliner]: procedures = 24, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 93 [2021-12-16 03:09:50,547 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 03:09:50,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 03:09:50,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 03:09:50,548 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 03:09:50,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:09:50" (1/1) ... [2021-12-16 03:09:50,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:09:50" (1/1) ... [2021-12-16 03:09:50,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:09:50" (1/1) ... [2021-12-16 03:09:50,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:09:50" (1/1) ... [2021-12-16 03:09:50,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:09:50" (1/1) ... [2021-12-16 03:09:50,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:09:50" (1/1) ... [2021-12-16 03:09:50,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:09:50" (1/1) ... [2021-12-16 03:09:50,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 03:09:50,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 03:09:50,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 03:09:50,601 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 03:09:50,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:09:50" (1/1) ... [2021-12-16 03:09:50,607 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 03:09:50,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:09:50,624 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-16 03:09:50,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-16 03:09:50,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 03:09:50,679 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-12-16 03:09:50,680 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-12-16 03:09:50,680 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-12-16 03:09:50,680 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-12-16 03:09:50,680 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-12-16 03:09:50,680 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-12-16 03:09:50,681 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-12-16 03:09:50,681 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-12-16 03:09:50,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 03:09:50,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 03:09:50,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 03:09:50,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-16 03:09:50,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-16 03:09:50,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 03:09:50,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 03:09:50,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 03:09:50,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 03:09:50,684 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-16 03:09:50,769 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 03:09:50,770 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 03:09:51,022 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 03:09:51,060 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 03:09:51,060 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-16 03:09:51,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:09:51 BoogieIcfgContainer [2021-12-16 03:09:51,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 03:09:51,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 03:09:51,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 03:09:51,067 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 03:09:51,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:09:50" (1/3) ... [2021-12-16 03:09:51,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@801ec86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:09:51, skipping insertion in model container [2021-12-16 03:09:51,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:09:50" (2/3) ... [2021-12-16 03:09:51,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@801ec86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:09:51, skipping insertion in model container [2021-12-16 03:09:51,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:09:51" (3/3) ... [2021-12-16 03:09:51,070 INFO L111 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2021-12-16 03:09:51,073 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-16 03:09:51,074 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 03:09:51,074 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 03:09:51,074 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-16 03:09:51,097 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,098 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,098 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,098 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,098 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,098 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,099 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,099 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,099 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,099 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,099 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,099 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,100 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,100 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,100 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,100 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,101 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,101 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,101 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,101 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,101 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,101 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,102 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,102 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,102 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,102 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,102 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,103 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,103 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,103 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,103 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,103 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,104 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,104 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,104 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,104 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,104 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,104 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,105 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,105 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,105 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,105 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,105 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,105 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,106 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_~cond~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,106 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_~cond~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,106 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_~cond~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,106 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_~cond~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,107 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_~cond~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,107 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_~cond~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,107 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,107 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,107 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,107 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,108 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_~cond~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,108 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_~cond~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,122 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,122 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,122 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,123 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,123 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,123 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,124 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,124 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,124 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,124 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_~cond~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,125 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,125 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,125 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,125 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:09:51,127 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-12-16 03:09:51,184 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 03:09:51,189 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-16 03:09:51,190 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-12-16 03:09:51,206 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 138 places, 135 transitions, 302 flow [2021-12-16 03:09:51,241 INFO L129 PetriNetUnfolder]: 10/131 cut-off events. [2021-12-16 03:09:51,241 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-16 03:09:51,245 INFO L84 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 131 events. 10/131 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2021-12-16 03:09:51,245 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 135 transitions, 302 flow [2021-12-16 03:09:51,248 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 118 transitions, 260 flow [2021-12-16 03:09:51,267 INFO L129 PetriNetUnfolder]: 10/117 cut-off events. [2021-12-16 03:09:51,268 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-16 03:09:51,268 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:09:51,268 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:09:51,269 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-16 03:09:51,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:09:51,273 INFO L85 PathProgramCache]: Analyzing trace with hash 673492433, now seen corresponding path program 1 times [2021-12-16 03:09:51,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:09:51,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507812133] [2021-12-16 03:09:51,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:09:51,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:09:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:09:51,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 03:09:51,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:09:51,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507812133] [2021-12-16 03:09:51,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507812133] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:09:51,495 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:09:51,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 03:09:51,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782235126] [2021-12-16 03:09:51,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:09:51,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-16 03:09:51,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:09:51,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-16 03:09:51,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 03:09:51,524 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 135 [2021-12-16 03:09:51,526 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 118 transitions, 260 flow. Second operand has 2 states, 2 states have (on average 122.0) internal successors, (244), 2 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:09:51,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:09:51,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 135 [2021-12-16 03:09:51,528 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:09:51,620 INFO L129 PetriNetUnfolder]: 121/427 cut-off events. [2021-12-16 03:09:51,621 INFO L130 PetriNetUnfolder]: For 106/107 co-relation queries the response was YES. [2021-12-16 03:09:51,624 INFO L84 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 427 events. 121/427 cut-off events. For 106/107 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1648 event pairs, 51 based on Foata normal form. 119/492 useless extension candidates. Maximal degree in co-relation 504. Up to 163 conditions per place. [2021-12-16 03:09:51,628 INFO L132 encePairwiseOnDemand]: 129/135 looper letters, 12 selfloop transitions, 0 changer transitions 2/112 dead transitions. [2021-12-16 03:09:51,628 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 112 transitions, 272 flow [2021-12-16 03:09:51,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-16 03:09:51,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-12-16 03:09:51,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 250 transitions. [2021-12-16 03:09:51,640 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9259259259259259 [2021-12-16 03:09:51,640 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 250 transitions. [2021-12-16 03:09:51,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 250 transitions. [2021-12-16 03:09:51,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:09:51,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 250 transitions. [2021-12-16 03:09:51,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 125.0) internal successors, (250), 2 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:09:51,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:09:51,672 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:09:51,673 INFO L186 Difference]: Start difference. First operand has 121 places, 118 transitions, 260 flow. Second operand 2 states and 250 transitions. [2021-12-16 03:09:51,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 112 transitions, 272 flow [2021-12-16 03:09:51,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 112 transitions, 256 flow, removed 0 selfloop flow, removed 8 redundant places. [2021-12-16 03:09:51,679 INFO L242 Difference]: Finished difference. Result has 114 places, 110 transitions, 228 flow [2021-12-16 03:09:51,681 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=228, PETRI_PLACES=114, PETRI_TRANSITIONS=110} [2021-12-16 03:09:51,683 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, -7 predicate places. [2021-12-16 03:09:51,683 INFO L470 AbstractCegarLoop]: Abstraction has has 114 places, 110 transitions, 228 flow [2021-12-16 03:09:51,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 122.0) internal successors, (244), 2 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:09:51,684 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:09:51,684 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:09:51,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 03:09:51,685 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-16 03:09:51,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:09:51,685 INFO L85 PathProgramCache]: Analyzing trace with hash 2100413457, now seen corresponding path program 1 times [2021-12-16 03:09:51,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:09:51,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961363056] [2021-12-16 03:09:51,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:09:51,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:09:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:09:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 03:09:52,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:09:52,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961363056] [2021-12-16 03:09:52,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961363056] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:09:52,004 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:09:52,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 03:09:52,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716439787] [2021-12-16 03:09:52,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:09:52,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 03:09:52,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:09:52,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 03:09:52,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-16 03:09:52,009 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 135 [2021-12-16 03:09:52,010 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 110 transitions, 228 flow. Second operand has 8 states, 8 states have (on average 93.5) internal successors, (748), 8 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:09:52,010 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:09:52,010 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 135 [2021-12-16 03:09:52,011 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:09:52,290 INFO L129 PetriNetUnfolder]: 555/1115 cut-off events. [2021-12-16 03:09:52,290 INFO L130 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2021-12-16 03:09:52,293 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1944 conditions, 1115 events. 555/1115 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5244 event pairs, 63 based on Foata normal form. 1/1008 useless extension candidates. Maximal degree in co-relation 1941. Up to 673 conditions per place. [2021-12-16 03:09:52,299 INFO L132 encePairwiseOnDemand]: 125/135 looper letters, 43 selfloop transitions, 7 changer transitions 4/128 dead transitions. [2021-12-16 03:09:52,299 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 128 transitions, 379 flow [2021-12-16 03:09:52,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 03:09:52,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-16 03:09:52,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 685 transitions. [2021-12-16 03:09:52,304 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7248677248677249 [2021-12-16 03:09:52,304 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 685 transitions. [2021-12-16 03:09:52,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 685 transitions. [2021-12-16 03:09:52,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:09:52,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 685 transitions. [2021-12-16 03:09:52,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:09:52,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 135.0) internal successors, (1080), 8 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:09:52,310 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 135.0) internal successors, (1080), 8 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:09:52,310 INFO L186 Difference]: Start difference. First operand has 114 places, 110 transitions, 228 flow. Second operand 7 states and 685 transitions. [2021-12-16 03:09:52,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 128 transitions, 379 flow [2021-12-16 03:09:52,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 128 transitions, 379 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-16 03:09:52,314 INFO L242 Difference]: Finished difference. Result has 121 places, 114 transitions, 269 flow [2021-12-16 03:09:52,314 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=269, PETRI_PLACES=121, PETRI_TRANSITIONS=114} [2021-12-16 03:09:52,315 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 0 predicate places. [2021-12-16 03:09:52,315 INFO L470 AbstractCegarLoop]: Abstraction has has 121 places, 114 transitions, 269 flow [2021-12-16 03:09:52,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.5) internal successors, (748), 8 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:09:52,316 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:09:52,316 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:09:52,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 03:09:52,317 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-16 03:09:52,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:09:52,317 INFO L85 PathProgramCache]: Analyzing trace with hash -417943514, now seen corresponding path program 1 times [2021-12-16 03:09:52,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:09:52,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105443061] [2021-12-16 03:09:52,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:09:52,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:09:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:09:52,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 03:09:52,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:09:52,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105443061] [2021-12-16 03:09:52,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105443061] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:09:52,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55523644] [2021-12-16 03:09:52,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:09:52,516 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:09:52,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:09:52,532 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 03:09:52,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-16 03:09:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:09:52,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 03:09:52,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:09:52,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 03:09:52,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 03:09:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 03:09:53,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55523644] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-16 03:09:53,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-16 03:09:53,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2021-12-16 03:09:53,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313530066] [2021-12-16 03:09:53,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:09:53,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 03:09:53,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:09:53,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 03:09:53,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-16 03:09:53,062 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 135 [2021-12-16 03:09:53,062 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 114 transitions, 269 flow. Second operand has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:09:53,062 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:09:53,062 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 135 [2021-12-16 03:09:53,062 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:09:53,407 INFO L129 PetriNetUnfolder]: 1365/3134 cut-off events. [2021-12-16 03:09:53,407 INFO L130 PetriNetUnfolder]: For 718/748 co-relation queries the response was YES. [2021-12-16 03:09:53,418 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6202 conditions, 3134 events. 1365/3134 cut-off events. For 718/748 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 23001 event pairs, 138 based on Foata normal form. 11/2626 useless extension candidates. Maximal degree in co-relation 6195. Up to 858 conditions per place. [2021-12-16 03:09:53,438 INFO L132 encePairwiseOnDemand]: 124/135 looper letters, 71 selfloop transitions, 27 changer transitions 0/185 dead transitions. [2021-12-16 03:09:53,439 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 185 transitions, 692 flow [2021-12-16 03:09:53,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 03:09:53,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-16 03:09:53,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 820 transitions. [2021-12-16 03:09:53,441 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8677248677248677 [2021-12-16 03:09:53,442 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 820 transitions. [2021-12-16 03:09:53,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 820 transitions. [2021-12-16 03:09:53,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:09:53,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 820 transitions. [2021-12-16 03:09:53,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:09:53,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 135.0) internal successors, (1080), 8 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:09:53,448 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 135.0) internal successors, (1080), 8 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:09:53,448 INFO L186 Difference]: Start difference. First operand has 121 places, 114 transitions, 269 flow. Second operand 7 states and 820 transitions. [2021-12-16 03:09:53,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 185 transitions, 692 flow [2021-12-16 03:09:53,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 185 transitions, 668 flow, removed 2 selfloop flow, removed 5 redundant places. [2021-12-16 03:09:53,457 INFO L242 Difference]: Finished difference. Result has 125 places, 140 transitions, 454 flow [2021-12-16 03:09:53,458 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=454, PETRI_PLACES=125, PETRI_TRANSITIONS=140} [2021-12-16 03:09:53,460 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 4 predicate places. [2021-12-16 03:09:53,460 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 140 transitions, 454 flow [2021-12-16 03:09:53,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:09:53,461 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:09:53,461 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:09:53,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-16 03:09:53,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:09:53,684 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-16 03:09:53,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:09:53,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1563315294, now seen corresponding path program 2 times [2021-12-16 03:09:53,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:09:53,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748472129] [2021-12-16 03:09:53,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:09:53,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:09:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:09:53,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 03:09:53,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:09:53,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748472129] [2021-12-16 03:09:53,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748472129] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:09:53,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:09:53,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 03:09:53,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845583182] [2021-12-16 03:09:53,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:09:53,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 03:09:53,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:09:53,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 03:09:53,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-16 03:09:53,834 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 135 [2021-12-16 03:09:53,835 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 140 transitions, 454 flow. Second operand has 8 states, 8 states have (on average 93.625) internal successors, (749), 8 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:09:53,835 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:09:53,835 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 135 [2021-12-16 03:09:53,836 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:09:54,899 INFO L129 PetriNetUnfolder]: 5613/10105 cut-off events. [2021-12-16 03:09:54,900 INFO L130 PetriNetUnfolder]: For 10411/11399 co-relation queries the response was YES. [2021-12-16 03:09:54,926 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26419 conditions, 10105 events. 5613/10105 cut-off events. For 10411/11399 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 78476 event pairs, 212 based on Foata normal form. 264/9465 useless extension candidates. Maximal degree in co-relation 26409. Up to 4060 conditions per place. [2021-12-16 03:09:54,981 INFO L132 encePairwiseOnDemand]: 122/135 looper letters, 218 selfloop transitions, 30 changer transitions 0/328 dead transitions. [2021-12-16 03:09:54,982 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 328 transitions, 1878 flow [2021-12-16 03:09:54,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 03:09:54,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-16 03:09:54,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1124 transitions. [2021-12-16 03:09:54,984 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7569023569023569 [2021-12-16 03:09:54,984 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1124 transitions. [2021-12-16 03:09:54,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1124 transitions. [2021-12-16 03:09:54,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:09:54,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1124 transitions. [2021-12-16 03:09:54,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 102.18181818181819) internal successors, (1124), 11 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:09:54,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 135.0) internal successors, (1620), 12 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:09:54,990 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 135.0) internal successors, (1620), 12 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:09:54,990 INFO L186 Difference]: Start difference. First operand has 125 places, 140 transitions, 454 flow. Second operand 11 states and 1124 transitions. [2021-12-16 03:09:54,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 328 transitions, 1878 flow [2021-12-16 03:09:54,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 328 transitions, 1878 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-16 03:09:55,002 INFO L242 Difference]: Finished difference. Result has 141 places, 164 transitions, 715 flow [2021-12-16 03:09:55,002 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=715, PETRI_PLACES=141, PETRI_TRANSITIONS=164} [2021-12-16 03:09:55,003 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 20 predicate places. [2021-12-16 03:09:55,003 INFO L470 AbstractCegarLoop]: Abstraction has has 141 places, 164 transitions, 715 flow [2021-12-16 03:09:55,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.625) internal successors, (749), 8 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:09:55,004 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:09:55,004 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:09:55,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 03:09:55,004 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-16 03:09:55,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:09:55,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1588058052, now seen corresponding path program 3 times [2021-12-16 03:09:55,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:09:55,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808382631] [2021-12-16 03:09:55,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:09:55,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:09:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:09:55,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 03:09:55,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:09:55,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808382631] [2021-12-16 03:09:55,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808382631] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:09:55,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133929937] [2021-12-16 03:09:55,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 03:09:55,210 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:09:55,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:09:55,224 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 03:09:55,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-16 03:09:55,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-16 03:09:55,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 03:09:55,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-16 03:09:55,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:09:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 03:09:55,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 03:09:55,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 03:09:55,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133929937] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-16 03:09:55,932 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-16 03:09:55,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 19 [2021-12-16 03:09:55,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258251037] [2021-12-16 03:09:55,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:09:55,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 03:09:55,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:09:55,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 03:09:55,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2021-12-16 03:09:55,935 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 135 [2021-12-16 03:09:55,936 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 164 transitions, 715 flow. Second operand has 8 states, 8 states have (on average 93.625) internal successors, (749), 8 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:09:55,940 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:09:55,941 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 135 [2021-12-16 03:09:55,941 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:09:57,583 INFO L129 PetriNetUnfolder]: 7743/16029 cut-off events. [2021-12-16 03:09:57,584 INFO L130 PetriNetUnfolder]: For 23578/24614 co-relation queries the response was YES. [2021-12-16 03:09:57,766 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44078 conditions, 16029 events. 7743/16029 cut-off events. For 23578/24614 co-relation queries the response was YES. Maximal size of possible extension queue 913. Compared 149798 event pairs, 717 based on Foata normal form. 518/15582 useless extension candidates. Maximal degree in co-relation 44061. Up to 3032 conditions per place. [2021-12-16 03:09:57,860 INFO L132 encePairwiseOnDemand]: 121/135 looper letters, 235 selfloop transitions, 71 changer transitions 0/386 dead transitions. [2021-12-16 03:09:57,860 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 386 transitions, 2551 flow [2021-12-16 03:09:57,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 03:09:57,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-16 03:09:57,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1341 transitions. [2021-12-16 03:09:57,863 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.764102564102564 [2021-12-16 03:09:57,863 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1341 transitions. [2021-12-16 03:09:57,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1341 transitions. [2021-12-16 03:09:57,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:09:57,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1341 transitions. [2021-12-16 03:09:57,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 103.15384615384616) internal successors, (1341), 13 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:09:57,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:09:57,869 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:09:57,869 INFO L186 Difference]: Start difference. First operand has 141 places, 164 transitions, 715 flow. Second operand 13 states and 1341 transitions. [2021-12-16 03:09:57,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 386 transitions, 2551 flow [2021-12-16 03:09:57,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 386 transitions, 2545 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-16 03:09:57,894 INFO L242 Difference]: Finished difference. Result has 160 places, 219 transitions, 1391 flow [2021-12-16 03:09:57,894 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1391, PETRI_PLACES=160, PETRI_TRANSITIONS=219} [2021-12-16 03:09:57,895 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 39 predicate places. [2021-12-16 03:09:57,895 INFO L470 AbstractCegarLoop]: Abstraction has has 160 places, 219 transitions, 1391 flow [2021-12-16 03:09:57,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.625) internal successors, (749), 8 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:09:57,896 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:09:57,896 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:09:57,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-16 03:09:58,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:09:58,111 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-16 03:09:58,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:09:58,112 INFO L85 PathProgramCache]: Analyzing trace with hash 207280632, now seen corresponding path program 1 times [2021-12-16 03:09:58,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:09:58,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280077651] [2021-12-16 03:09:58,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:09:58,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:09:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:09:58,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 03:09:58,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:09:58,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280077651] [2021-12-16 03:09:58,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280077651] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:09:58,210 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:09:58,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 03:09:58,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014263024] [2021-12-16 03:09:58,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:09:58,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 03:09:58,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:09:58,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 03:09:58,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-16 03:09:58,211 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 135 [2021-12-16 03:09:58,212 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 219 transitions, 1391 flow. Second operand has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:09:58,212 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:09:58,212 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 135 [2021-12-16 03:09:58,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:09:59,970 INFO L129 PetriNetUnfolder]: 5858/14644 cut-off events. [2021-12-16 03:09:59,970 INFO L130 PetriNetUnfolder]: For 47042/48474 co-relation queries the response was YES. [2021-12-16 03:10:00,097 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48976 conditions, 14644 events. 5858/14644 cut-off events. For 47042/48474 co-relation queries the response was YES. Maximal size of possible extension queue 909. Compared 153015 event pairs, 795 based on Foata normal form. 679/14151 useless extension candidates. Maximal degree in co-relation 48949. Up to 4066 conditions per place. [2021-12-16 03:10:00,333 INFO L132 encePairwiseOnDemand]: 125/135 looper letters, 178 selfloop transitions, 45 changer transitions 0/321 dead transitions. [2021-12-16 03:10:00,333 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 321 transitions, 2757 flow [2021-12-16 03:10:00,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 03:10:00,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-16 03:10:00,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 690 transitions. [2021-12-16 03:10:00,335 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8518518518518519 [2021-12-16 03:10:00,335 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 690 transitions. [2021-12-16 03:10:00,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 690 transitions. [2021-12-16 03:10:00,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:10:00,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 690 transitions. [2021-12-16 03:10:00,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:10:00,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 135.0) internal successors, (945), 7 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:10:00,338 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 135.0) internal successors, (945), 7 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:10:00,338 INFO L186 Difference]: Start difference. First operand has 160 places, 219 transitions, 1391 flow. Second operand 6 states and 690 transitions. [2021-12-16 03:10:00,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 321 transitions, 2757 flow [2021-12-16 03:10:00,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 321 transitions, 2711 flow, removed 21 selfloop flow, removed 2 redundant places. [2021-12-16 03:10:00,402 INFO L242 Difference]: Finished difference. Result has 166 places, 225 transitions, 1558 flow [2021-12-16 03:10:00,402 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=1359, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1558, PETRI_PLACES=166, PETRI_TRANSITIONS=225} [2021-12-16 03:10:00,404 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 45 predicate places. [2021-12-16 03:10:00,404 INFO L470 AbstractCegarLoop]: Abstraction has has 166 places, 225 transitions, 1558 flow [2021-12-16 03:10:00,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:10:00,405 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:10:00,405 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:10:00,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 03:10:00,405 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-16 03:10:00,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:10:00,406 INFO L85 PathProgramCache]: Analyzing trace with hash -403001526, now seen corresponding path program 4 times [2021-12-16 03:10:00,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:10:00,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858592542] [2021-12-16 03:10:00,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:10:00,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:10:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:10:00,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 03:10:00,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:10:00,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858592542] [2021-12-16 03:10:00,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858592542] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:10:00,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627511273] [2021-12-16 03:10:00,619 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-16 03:10:00,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:10:00,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:10:00,632 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 03:10:00,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-16 03:10:00,717 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-16 03:10:00,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 03:10:00,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 03:10:00,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:10:01,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 03:10:01,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 03:10:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 03:10:01,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627511273] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-16 03:10:01,403 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-16 03:10:01,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 20 [2021-12-16 03:10:01,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340864369] [2021-12-16 03:10:01,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:10:01,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 03:10:01,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:10:01,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 03:10:01,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2021-12-16 03:10:01,405 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 135 [2021-12-16 03:10:01,406 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 225 transitions, 1558 flow. Second operand has 8 states, 8 states have (on average 93.625) internal successors, (749), 8 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:10:01,406 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:10:01,406 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 135 [2021-12-16 03:10:01,406 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:10:06,127 INFO L129 PetriNetUnfolder]: 14611/35870 cut-off events. [2021-12-16 03:10:06,129 INFO L130 PetriNetUnfolder]: For 113297/115146 co-relation queries the response was YES. [2021-12-16 03:10:06,442 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112439 conditions, 35870 events. 14611/35870 cut-off events. For 113297/115146 co-relation queries the response was YES. Maximal size of possible extension queue 1909. Compared 424457 event pairs, 1938 based on Foata normal form. 813/33891 useless extension candidates. Maximal degree in co-relation 112408. Up to 5819 conditions per place. [2021-12-16 03:10:06,630 INFO L132 encePairwiseOnDemand]: 119/135 looper letters, 323 selfloop transitions, 146 changer transitions 0/549 dead transitions. [2021-12-16 03:10:06,631 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 549 transitions, 5160 flow [2021-12-16 03:10:06,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 03:10:06,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-16 03:10:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1367 transitions. [2021-12-16 03:10:06,649 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7789173789173789 [2021-12-16 03:10:06,649 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1367 transitions. [2021-12-16 03:10:06,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1367 transitions. [2021-12-16 03:10:06,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:10:06,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1367 transitions. [2021-12-16 03:10:06,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 105.15384615384616) internal successors, (1367), 13 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:10:06,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:10:06,655 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:10:06,655 INFO L186 Difference]: Start difference. First operand has 166 places, 225 transitions, 1558 flow. Second operand 13 states and 1367 transitions. [2021-12-16 03:10:06,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 549 transitions, 5160 flow [2021-12-16 03:10:06,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 549 transitions, 5067 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-16 03:10:06,928 INFO L242 Difference]: Finished difference. Result has 183 places, 318 transitions, 3103 flow [2021-12-16 03:10:06,929 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=1524, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3103, PETRI_PLACES=183, PETRI_TRANSITIONS=318} [2021-12-16 03:10:06,929 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 62 predicate places. [2021-12-16 03:10:06,929 INFO L470 AbstractCegarLoop]: Abstraction has has 183 places, 318 transitions, 3103 flow [2021-12-16 03:10:06,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.625) internal successors, (749), 8 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:10:06,930 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:10:06,930 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:10:06,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-16 03:10:07,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:10:07,134 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-16 03:10:07,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:10:07,135 INFO L85 PathProgramCache]: Analyzing trace with hash -824574558, now seen corresponding path program 5 times [2021-12-16 03:10:07,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:10:07,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924986806] [2021-12-16 03:10:07,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:10:07,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:10:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:10:07,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 03:10:07,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:10:07,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924986806] [2021-12-16 03:10:07,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924986806] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:10:07,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860224920] [2021-12-16 03:10:07,249 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-16 03:10:07,249 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:10:07,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:10:07,263 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 03:10:07,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-16 03:10:07,351 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 03:10:07,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 03:10:07,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 03:10:07,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:10:07,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 03:10:07,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 03:10:07,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 03:10:07,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860224920] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-16 03:10:07,830 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-16 03:10:07,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2021-12-16 03:10:07,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815183871] [2021-12-16 03:10:07,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:10:07,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 03:10:07,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:10:07,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 03:10:07,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-16 03:10:07,836 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 135 [2021-12-16 03:10:07,837 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 318 transitions, 3103 flow. Second operand has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:10:07,837 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:10:07,837 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 135 [2021-12-16 03:10:07,837 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:10:09,477 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L104-->L105-1: Formula: (let ((.cse0 (< 1 v_~n2~0_In_3))) (or (and .cse0 (= v_~n2~0_Out_6 (+ v_~n2~0_In_3 (- 2))) (= v_~p2~0_Out_6 (+ v_~p2~0_In_3 (* v_~m~0_In_7 2)))) (and (not .cse0) (= v_~p2~0_In_3 v_~p2~0_Out_6) (= v_~n2~0_In_3 v_~n2~0_Out_6)))) InVars {~p2~0=v_~p2~0_In_3, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_In_3} OutVars{~p2~0=v_~p2~0_Out_6, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_Out_6} AuxVars[] AssignedVars[~n2~0, ~p2~0][390], [32#L105-1true, Black: 570#(or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), 2496#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 774#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), Black: 542#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 580#(or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 813#true, 776#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), 1468#true, 67#L66true, 1457#(or (and (= 1 thread1Thread1of1ForFork1_~cond~0) (< 0 ~n1~0)) (and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0))), 785#true, 82#L84-1true, Black: 148#(and (= (+ (* 4294967296 (div ~p2~0 4294967296)) ~p1~0) (+ (* 4294967296 (div ~p1~0 4294967296)) ~p2~0)) (= ~n1~0 ~n2~0)), Black: 1443#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1439#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (< 0 ~n2~0)), Black: 794#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 1435#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 789#(<= ~n1~0 ~n2~0), 6#L55true, Black: 800#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 1284#(or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 805#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 1437#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0))), Black: 802#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 819#(< 0 ~n2~0), Black: 798#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 ~n2~0)), Black: 1288#(or (<= ~n1~0 0) (< 0 ~n2~0)), Black: 1441#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1187#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 115#L132-4true, 141#true, Black: 1839#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), Black: 2097#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1461#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0)), Black: 2101#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2093#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1463#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= thread2Thread1of1ForFork3_~cond~1 (* 256 (div thread2Thread1of1ForFork3_~cond~1 256))) (< 0 (+ (div thread2Thread1of1ForFork3_~cond~1 256) 1))), Black: 1915#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 2091#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2099#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))))]) [2021-12-16 03:10:09,478 INFO L384 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2021-12-16 03:10:09,478 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-12-16 03:10:09,478 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-12-16 03:10:09,478 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-12-16 03:10:09,483 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L104-->L105-1: Formula: (let ((.cse0 (< 1 v_~n2~0_In_3))) (or (and .cse0 (= v_~n2~0_Out_6 (+ v_~n2~0_In_3 (- 2))) (= v_~p2~0_Out_6 (+ v_~p2~0_In_3 (* v_~m~0_In_7 2)))) (and (not .cse0) (= v_~p2~0_In_3 v_~p2~0_Out_6) (= v_~n2~0_In_3 v_~n2~0_Out_6)))) InVars {~p2~0=v_~p2~0_In_3, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_In_3} OutVars{~p2~0=v_~p2~0_Out_6, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_Out_6} AuxVars[] AssignedVars[~n2~0, ~p2~0][390], [32#L105-1true, Black: 570#(or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 776#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), 2496#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 774#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), Black: 580#(or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 813#true, 1468#true, 67#L66true, 785#true, 45#L48-1true, 82#L84-1true, Black: 148#(and (= (+ (* 4294967296 (div ~p2~0 4294967296)) ~p1~0) (+ (* 4294967296 (div ~p1~0 4294967296)) ~p2~0)) (= ~n1~0 ~n2~0)), Black: 1443#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1439#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (< 0 ~n2~0)), Black: 1435#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 794#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 789#(<= ~n1~0 ~n2~0), Black: 800#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 1284#(or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 805#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 1437#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0))), Black: 819#(< 0 ~n2~0), Black: 802#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 1288#(or (<= ~n1~0 0) (< 0 ~n2~0)), Black: 798#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 ~n2~0)), 542#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 1441#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1187#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 115#L132-4true, 141#true, Black: 1839#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), Black: 2097#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2101#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1461#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0)), Black: 1457#(or (and (= 1 thread1Thread1of1ForFork1_~cond~0) (< 0 ~n1~0)) (and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0))), Black: 2093#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1463#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= thread2Thread1of1ForFork3_~cond~1 (* 256 (div thread2Thread1of1ForFork3_~cond~1 256))) (< 0 (+ (div thread2Thread1of1ForFork3_~cond~1 256) 1))), Black: 1915#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 2091#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2099#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))))]) [2021-12-16 03:10:09,484 INFO L384 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2021-12-16 03:10:09,484 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-12-16 03:10:09,484 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-12-16 03:10:09,484 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-12-16 03:10:09,678 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L104-->L105-1: Formula: (let ((.cse0 (< 1 v_~n2~0_In_3))) (or (and .cse0 (= v_~n2~0_Out_6 (+ v_~n2~0_In_3 (- 2))) (= v_~p2~0_Out_6 (+ v_~p2~0_In_3 (* v_~m~0_In_7 2)))) (and (not .cse0) (= v_~p2~0_In_3 v_~p2~0_Out_6) (= v_~n2~0_In_3 v_~n2~0_Out_6)))) InVars {~p2~0=v_~p2~0_In_3, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_In_3} OutVars{~p2~0=v_~p2~0_Out_6, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_Out_6} AuxVars[] AssignedVars[~n2~0, ~p2~0][455], [32#L105-1true, 131#L46-1true, Black: 570#(or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), 2496#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 774#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), Black: 542#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 580#(or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 1461#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0)), 776#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), 813#true, 67#L66true, 785#true, 82#L84-1true, Black: 148#(and (= (+ (* 4294967296 (div ~p2~0 4294967296)) ~p1~0) (+ (* 4294967296 (div ~p1~0 4294967296)) ~p2~0)) (= ~n1~0 ~n2~0)), Black: 1443#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1439#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (< 0 ~n2~0)), Black: 794#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 1435#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 789#(<= ~n1~0 ~n2~0), Black: 800#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 1284#(or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 805#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 1437#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0))), Black: 802#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 819#(< 0 ~n2~0), Black: 798#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 ~n2~0)), Black: 1288#(or (<= ~n1~0 0) (< 0 ~n2~0)), Black: 1441#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1187#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 115#L132-4true, 141#true, Black: 1839#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), Black: 2097#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 1915#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 2101#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2093#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1457#(or (and (= 1 thread1Thread1of1ForFork1_~cond~0) (< 0 ~n1~0)) (and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0))), Black: 1463#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= thread2Thread1of1ForFork3_~cond~1 (* 256 (div thread2Thread1of1ForFork3_~cond~1 256))) (< 0 (+ (div thread2Thread1of1ForFork3_~cond~1 256) 1))), Black: 2091#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2099#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))))]) [2021-12-16 03:10:09,678 INFO L384 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2021-12-16 03:10:09,679 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2021-12-16 03:10:09,679 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2021-12-16 03:10:09,679 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2021-12-16 03:10:09,946 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L104-->L105-1: Formula: (let ((.cse0 (< 1 v_~n2~0_In_3))) (or (and .cse0 (= v_~n2~0_Out_6 (+ v_~n2~0_In_3 (- 2))) (= v_~p2~0_Out_6 (+ v_~p2~0_In_3 (* v_~m~0_In_7 2)))) (and (not .cse0) (= v_~p2~0_In_3 v_~p2~0_Out_6) (= v_~n2~0_In_3 v_~n2~0_Out_6)))) InVars {~p2~0=v_~p2~0_In_3, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_In_3} OutVars{~p2~0=v_~p2~0_Out_6, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_Out_6} AuxVars[] AssignedVars[~n2~0, ~p2~0][455], [32#L105-1true, 131#L46-1true, Black: 570#(or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), 2496#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 776#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 774#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), Black: 580#(or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 69#L67-1true, 1461#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0)), 813#true, 785#true, 82#L84-1true, Black: 148#(and (= (+ (* 4294967296 (div ~p2~0 4294967296)) ~p1~0) (+ (* 4294967296 (div ~p1~0 4294967296)) ~p2~0)) (= ~n1~0 ~n2~0)), Black: 1443#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1439#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (< 0 ~n2~0)), Black: 794#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 1435#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 789#(<= ~n1~0 ~n2~0), Black: 1284#(or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 800#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 805#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 1437#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0))), Black: 802#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 819#(< 0 ~n2~0), Black: 798#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 ~n2~0)), Black: 1288#(or (<= ~n1~0 0) (< 0 ~n2~0)), Black: 1441#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 542#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 1187#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 115#L132-4true, 141#true, Black: 1839#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 1915#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 2097#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2101#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2093#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1457#(or (and (= 1 thread1Thread1of1ForFork1_~cond~0) (< 0 ~n1~0)) (and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0))), Black: 1463#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= thread2Thread1of1ForFork3_~cond~1 (* 256 (div thread2Thread1of1ForFork3_~cond~1 256))) (< 0 (+ (div thread2Thread1of1ForFork3_~cond~1 256) 1))), Black: 2091#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2099#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))))]) [2021-12-16 03:10:09,947 INFO L384 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2021-12-16 03:10:09,947 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-12-16 03:10:09,947 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-12-16 03:10:09,947 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-12-16 03:10:09,952 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L104-->L105-1: Formula: (let ((.cse0 (< 1 v_~n2~0_In_3))) (or (and .cse0 (= v_~n2~0_Out_6 (+ v_~n2~0_In_3 (- 2))) (= v_~p2~0_Out_6 (+ v_~p2~0_In_3 (* v_~m~0_In_7 2)))) (and (not .cse0) (= v_~p2~0_In_3 v_~p2~0_Out_6) (= v_~n2~0_In_3 v_~n2~0_Out_6)))) InVars {~p2~0=v_~p2~0_In_3, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_In_3} OutVars{~p2~0=v_~p2~0_Out_6, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_Out_6} AuxVars[] AssignedVars[~n2~0, ~p2~0][390], [32#L105-1true, Black: 570#(or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), 2496#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 776#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 774#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), Black: 580#(or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 813#true, 1468#true, 67#L66true, 785#true, 82#L84-1true, Black: 148#(and (= (+ (* 4294967296 (div ~p2~0 4294967296)) ~p1~0) (+ (* 4294967296 (div ~p1~0 4294967296)) ~p2~0)) (= ~n1~0 ~n2~0)), Black: 1443#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1439#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (< 0 ~n2~0)), Black: 1435#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 794#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 789#(<= ~n1~0 ~n2~0), Black: 1284#(or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 800#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 805#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 1437#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0))), Black: 802#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 819#(< 0 ~n2~0), Black: 798#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 ~n2~0)), Black: 1288#(or (<= ~n1~0 0) (< 0 ~n2~0)), 542#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 1441#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1187#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 34#L47true, 115#L132-4true, 141#true, Black: 1839#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), Black: 2097#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1461#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0)), Black: 2101#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1457#(or (and (= 1 thread1Thread1of1ForFork1_~cond~0) (< 0 ~n1~0)) (and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0))), Black: 2093#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1463#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= thread2Thread1of1ForFork3_~cond~1 (* 256 (div thread2Thread1of1ForFork3_~cond~1 256))) (< 0 (+ (div thread2Thread1of1ForFork3_~cond~1 256) 1))), Black: 1915#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 2091#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2099#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))))]) [2021-12-16 03:10:09,953 INFO L384 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2021-12-16 03:10:09,953 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-16 03:10:09,953 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-16 03:10:09,953 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-16 03:10:10,104 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L104-->L105-1: Formula: (let ((.cse0 (< 1 v_~n2~0_In_3))) (or (and .cse0 (= v_~n2~0_Out_6 (+ v_~n2~0_In_3 (- 2))) (= v_~p2~0_Out_6 (+ v_~p2~0_In_3 (* v_~m~0_In_7 2)))) (and (not .cse0) (= v_~p2~0_In_3 v_~p2~0_Out_6) (= v_~n2~0_In_3 v_~n2~0_Out_6)))) InVars {~p2~0=v_~p2~0_In_3, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_In_3} OutVars{~p2~0=v_~p2~0_Out_6, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_Out_6} AuxVars[] AssignedVars[~n2~0, ~p2~0][424], [32#L105-1true, 1463#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= thread2Thread1of1ForFork3_~cond~1 (* 256 (div thread2Thread1of1ForFork3_~cond~1 256))) (< 0 (+ (div thread2Thread1of1ForFork3_~cond~1 256) 1))), 131#L46-1true, Black: 570#(or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 776#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 774#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), Black: 542#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 580#(or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 813#true, 785#true, 82#L84-1true, Black: 148#(and (= (+ (* 4294967296 (div ~p2~0 4294967296)) ~p1~0) (+ (* 4294967296 (div ~p1~0 4294967296)) ~p2~0)) (= ~n1~0 ~n2~0)), 120#L74true, 2537#(or (<= ~n1~0 0) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), 162#true, Black: 1443#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1439#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (< 0 ~n2~0)), Black: 794#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 1435#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 789#(<= ~n1~0 ~n2~0), Black: 1284#(or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 800#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 805#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 1437#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0))), Black: 802#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 819#(< 0 ~n2~0), Black: 798#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 ~n2~0)), Black: 1288#(or (<= ~n1~0 0) (< 0 ~n2~0)), Black: 1441#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1187#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 115#L132-4true, 141#true, Black: 1839#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), Black: 2097#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 1915#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 1461#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0)), Black: 2101#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2093#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1457#(or (and (= 1 thread1Thread1of1ForFork1_~cond~0) (< 0 ~n1~0)) (and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0))), Black: 2091#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2099#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))))]) [2021-12-16 03:10:10,104 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2021-12-16 03:10:10,104 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2021-12-16 03:10:10,104 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2021-12-16 03:10:10,105 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2021-12-16 03:10:10,105 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L104-->L105-1: Formula: (let ((.cse0 (< 1 v_~n2~0_In_3))) (or (and .cse0 (= v_~n2~0_Out_6 (+ v_~n2~0_In_3 (- 2))) (= v_~p2~0_Out_6 (+ v_~p2~0_In_3 (* v_~m~0_In_7 2)))) (and (not .cse0) (= v_~p2~0_In_3 v_~p2~0_Out_6) (= v_~n2~0_In_3 v_~n2~0_Out_6)))) InVars {~p2~0=v_~p2~0_In_3, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_In_3} OutVars{~p2~0=v_~p2~0_Out_6, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_Out_6} AuxVars[] AssignedVars[~n2~0, ~p2~0][390], [32#L105-1true, Black: 570#(or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 776#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), 2496#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 774#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), Black: 580#(or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 69#L67-1true, 813#true, 1468#true, 785#true, 45#L48-1true, 82#L84-1true, Black: 148#(and (= (+ (* 4294967296 (div ~p2~0 4294967296)) ~p1~0) (+ (* 4294967296 (div ~p1~0 4294967296)) ~p2~0)) (= ~n1~0 ~n2~0)), Black: 1443#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1439#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (< 0 ~n2~0)), Black: 794#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 1435#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 789#(<= ~n1~0 ~n2~0), Black: 800#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 1284#(or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 805#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 1437#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0))), Black: 802#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 819#(< 0 ~n2~0), Black: 798#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 ~n2~0)), Black: 1288#(or (<= ~n1~0 0) (< 0 ~n2~0)), Black: 1441#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 542#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 1187#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 115#L132-4true, 141#true, Black: 1839#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), Black: 2097#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1461#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0)), Black: 2101#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1457#(or (and (= 1 thread1Thread1of1ForFork1_~cond~0) (< 0 ~n1~0)) (and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0))), Black: 2093#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1463#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= thread2Thread1of1ForFork3_~cond~1 (* 256 (div thread2Thread1of1ForFork3_~cond~1 256))) (< 0 (+ (div thread2Thread1of1ForFork3_~cond~1 256) 1))), Black: 1915#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 2091#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2099#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))))]) [2021-12-16 03:10:10,106 INFO L384 tUnfolder$Statistics]: this new event has 75 ancestors and is not cut-off event [2021-12-16 03:10:10,106 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is not cut-off event [2021-12-16 03:10:10,106 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is not cut-off event [2021-12-16 03:10:10,106 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is not cut-off event [2021-12-16 03:10:10,242 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L104-->L105-1: Formula: (let ((.cse0 (< 1 v_~n2~0_In_3))) (or (and .cse0 (= v_~n2~0_Out_6 (+ v_~n2~0_In_3 (- 2))) (= v_~p2~0_Out_6 (+ v_~p2~0_In_3 (* v_~m~0_In_7 2)))) (and (not .cse0) (= v_~p2~0_In_3 v_~p2~0_Out_6) (= v_~n2~0_In_3 v_~n2~0_Out_6)))) InVars {~p2~0=v_~p2~0_In_3, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_In_3} OutVars{~p2~0=v_~p2~0_Out_6, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_Out_6} AuxVars[] AssignedVars[~n2~0, ~p2~0][424], [32#L105-1true, 1463#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= thread2Thread1of1ForFork3_~cond~1 (* 256 (div thread2Thread1of1ForFork3_~cond~1 256))) (< 0 (+ (div thread2Thread1of1ForFork3_~cond~1 256) 1))), 131#L46-1true, Black: 570#(or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 776#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 774#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), Black: 542#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 580#(or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 813#true, 785#true, 82#L84-1true, Black: 148#(and (= (+ (* 4294967296 (div ~p2~0 4294967296)) ~p1~0) (+ (* 4294967296 (div ~p1~0 4294967296)) ~p2~0)) (= ~n1~0 ~n2~0)), 2537#(or (<= ~n1~0 0) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), 162#true, Black: 1443#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1439#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (< 0 ~n2~0)), Black: 794#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 1435#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 789#(<= ~n1~0 ~n2~0), Black: 800#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 1284#(or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 805#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 1437#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0))), Black: 802#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 819#(< 0 ~n2~0), Black: 798#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 ~n2~0)), Black: 1288#(or (<= ~n1~0 0) (< 0 ~n2~0)), Black: 1441#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1187#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 115#L132-4true, 141#true, Black: 1839#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), Black: 2097#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 28#L65-1true, 1915#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 1461#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0)), Black: 2101#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2093#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1457#(or (and (= 1 thread1Thread1of1ForFork1_~cond~0) (< 0 ~n1~0)) (and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0))), Black: 2091#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2099#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))))]) [2021-12-16 03:10:10,243 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2021-12-16 03:10:10,243 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-16 03:10:10,243 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-16 03:10:10,243 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-16 03:10:10,305 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L104-->L105-1: Formula: (let ((.cse0 (< 1 v_~n2~0_In_3))) (or (and .cse0 (= v_~n2~0_Out_6 (+ v_~n2~0_In_3 (- 2))) (= v_~p2~0_Out_6 (+ v_~p2~0_In_3 (* v_~m~0_In_7 2)))) (and (not .cse0) (= v_~p2~0_In_3 v_~p2~0_Out_6) (= v_~n2~0_In_3 v_~n2~0_Out_6)))) InVars {~p2~0=v_~p2~0_In_3, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_In_3} OutVars{~p2~0=v_~p2~0_Out_6, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_Out_6} AuxVars[] AssignedVars[~n2~0, ~p2~0][352], [32#L105-1true, 131#L46-1true, 1463#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= thread2Thread1of1ForFork3_~cond~1 (* 256 (div thread2Thread1of1ForFork3_~cond~1 256))) (< 0 (+ (div thread2Thread1of1ForFork3_~cond~1 256) 1))), Black: 570#(or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 776#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 774#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), Black: 542#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 580#(or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 813#true, 1468#true, 785#true, 82#L84-1true, Black: 148#(and (= (+ (* 4294967296 (div ~p2~0 4294967296)) ~p1~0) (+ (* 4294967296 (div ~p1~0 4294967296)) ~p2~0)) (= ~n1~0 ~n2~0)), 2537#(or (<= ~n1~0 0) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 1443#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 162#true, Black: 1439#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (< 0 ~n2~0)), Black: 1435#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 794#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 789#(<= ~n1~0 ~n2~0), Black: 1284#(or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 800#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 805#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 1437#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0))), Black: 802#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 819#(< 0 ~n2~0), Black: 798#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 ~n2~0)), Black: 1288#(or (<= ~n1~0 0) (< 0 ~n2~0)), Black: 1441#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1187#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 115#L132-4true, 141#true, Black: 1839#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), Black: 2097#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 28#L65-1true, Black: 2101#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1461#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0)), Black: 2093#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1457#(or (and (= 1 thread1Thread1of1ForFork1_~cond~0) (< 0 ~n1~0)) (and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0))), Black: 1915#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 2091#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2099#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))))]) [2021-12-16 03:10:10,305 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2021-12-16 03:10:10,306 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-16 03:10:10,306 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-16 03:10:10,306 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-16 03:10:10,308 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L104-->L105-1: Formula: (let ((.cse0 (< 1 v_~n2~0_In_3))) (or (and .cse0 (= v_~n2~0_Out_6 (+ v_~n2~0_In_3 (- 2))) (= v_~p2~0_Out_6 (+ v_~p2~0_In_3 (* v_~m~0_In_7 2)))) (and (not .cse0) (= v_~p2~0_In_3 v_~p2~0_Out_6) (= v_~n2~0_In_3 v_~n2~0_Out_6)))) InVars {~p2~0=v_~p2~0_In_3, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_In_3} OutVars{~p2~0=v_~p2~0_Out_6, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_Out_6} AuxVars[] AssignedVars[~n2~0, ~p2~0][352], [32#L105-1true, 131#L46-1true, Black: 570#(or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 776#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 542#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 580#(or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 813#true, 1468#true, 785#true, 82#L84-1true, Black: 148#(and (= (+ (* 4294967296 (div ~p2~0 4294967296)) ~p1~0) (+ (* 4294967296 (div ~p1~0 4294967296)) ~p2~0)) (= ~n1~0 ~n2~0)), 2537#(or (<= ~n1~0 0) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 1443#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1439#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (< 0 ~n2~0)), Black: 1435#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 794#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 789#(<= ~n1~0 ~n2~0), Black: 1284#(or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 800#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 805#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 1437#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0))), Black: 802#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 819#(< 0 ~n2~0), Black: 798#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 ~n2~0)), Black: 1288#(or (<= ~n1~0 0) (< 0 ~n2~0)), Black: 1441#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1187#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 115#L132-4true, 141#true, Black: 1839#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), Black: 2097#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 28#L65-1true, Black: 2101#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 774#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), Black: 1461#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0)), Black: 2093#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1457#(or (and (= 1 thread1Thread1of1ForFork1_~cond~0) (< 0 ~n1~0)) (and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0))), Black: 1915#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 1463#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= thread2Thread1of1ForFork3_~cond~1 (* 256 (div thread2Thread1of1ForFork3_~cond~1 256))) (< 0 (+ (div thread2Thread1of1ForFork3_~cond~1 256) 1))), Black: 2091#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2099#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))))]) [2021-12-16 03:10:10,308 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2021-12-16 03:10:10,308 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-16 03:10:10,308 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-16 03:10:10,309 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-16 03:10:10,372 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([385] L104-->L105-1: Formula: (let ((.cse0 (< 1 v_~n2~0_In_3))) (or (and .cse0 (= v_~n2~0_Out_6 (+ v_~n2~0_In_3 (- 2))) (= v_~p2~0_Out_6 (+ v_~p2~0_In_3 (* v_~m~0_In_7 2)))) (and (not .cse0) (= v_~p2~0_In_3 v_~p2~0_Out_6) (= v_~n2~0_In_3 v_~n2~0_Out_6)))) InVars {~p2~0=v_~p2~0_In_3, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_In_3} OutVars{~p2~0=v_~p2~0_Out_6, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_Out_6} AuxVars[] AssignedVars[~n2~0, ~p2~0][390], [32#L105-1true, Black: 570#(or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 776#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), 2496#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 774#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), 69#L67-1true, Black: 580#(or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 813#true, 1468#true, 785#true, 45#L48-1true, 82#L84-1true, Black: 148#(and (= (+ (* 4294967296 (div ~p2~0 4294967296)) ~p1~0) (+ (* 4294967296 (div ~p1~0 4294967296)) ~p2~0)) (= ~n1~0 ~n2~0)), Black: 1443#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1439#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (< 0 ~n2~0)), Black: 794#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 1435#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 789#(<= ~n1~0 ~n2~0), Black: 1284#(or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 800#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 805#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 1437#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0))), Black: 802#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 819#(< 0 ~n2~0), Black: 798#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 ~n2~0)), Black: 1288#(or (<= ~n1~0 0) (< 0 ~n2~0)), Black: 1441#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 542#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 1187#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 115#L132-4true, 141#true, Black: 1839#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), Black: 2097#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2101#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1461#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0)), Black: 1457#(or (and (= 1 thread1Thread1of1ForFork1_~cond~0) (< 0 ~n1~0)) (and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0))), Black: 2093#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1915#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 1463#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= thread2Thread1of1ForFork3_~cond~1 (* 256 (div thread2Thread1of1ForFork3_~cond~1 256))) (< 0 (+ (div thread2Thread1of1ForFork3_~cond~1 256) 1))), Black: 2091#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2099#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))))]) [2021-12-16 03:10:10,373 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2021-12-16 03:10:10,373 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2021-12-16 03:10:10,373 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2021-12-16 03:10:10,373 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2021-12-16 03:10:10,373 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2021-12-16 03:10:10,737 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L104-->L105-1: Formula: (let ((.cse0 (< 1 v_~n2~0_In_3))) (or (and .cse0 (= v_~n2~0_Out_6 (+ v_~n2~0_In_3 (- 2))) (= v_~p2~0_Out_6 (+ v_~p2~0_In_3 (* v_~m~0_In_7 2)))) (and (not .cse0) (= v_~p2~0_In_3 v_~p2~0_Out_6) (= v_~n2~0_In_3 v_~n2~0_Out_6)))) InVars {~p2~0=v_~p2~0_In_3, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_In_3} OutVars{~p2~0=v_~p2~0_Out_6, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_Out_6} AuxVars[] AssignedVars[~n2~0, ~p2~0][455], [18#L133-2true, 32#L105-1true, Black: 570#(or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), 2496#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 774#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), Black: 542#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 580#(or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 1461#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0)), 813#true, 776#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), 67#L66true, 785#true, 82#L84-1true, Black: 148#(and (= (+ (* 4294967296 (div ~p2~0 4294967296)) ~p1~0) (+ (* 4294967296 (div ~p1~0 4294967296)) ~p2~0)) (= ~n1~0 ~n2~0)), Black: 1443#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1439#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (< 0 ~n2~0)), Black: 794#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 1435#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 789#(<= ~n1~0 ~n2~0), Black: 1284#(or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 800#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 805#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 1437#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0))), Black: 802#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 819#(< 0 ~n2~0), Black: 798#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 ~n2~0)), Black: 1288#(or (<= ~n1~0 0) (< 0 ~n2~0)), Black: 1441#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1187#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 141#true, Black: 1839#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 1915#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 2097#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2101#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2093#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1457#(or (and (= 1 thread1Thread1of1ForFork1_~cond~0) (< 0 ~n1~0)) (and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0))), Black: 1463#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= thread2Thread1of1ForFork3_~cond~1 (* 256 (div thread2Thread1of1ForFork3_~cond~1 256))) (< 0 (+ (div thread2Thread1of1ForFork3_~cond~1 256) 1))), Black: 2091#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2099#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))))]) [2021-12-16 03:10:10,737 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2021-12-16 03:10:10,737 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-16 03:10:10,737 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-16 03:10:10,737 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-16 03:10:10,814 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L104-->L105-1: Formula: (let ((.cse0 (< 1 v_~n2~0_In_3))) (or (and .cse0 (= v_~n2~0_Out_6 (+ v_~n2~0_In_3 (- 2))) (= v_~p2~0_Out_6 (+ v_~p2~0_In_3 (* v_~m~0_In_7 2)))) (and (not .cse0) (= v_~p2~0_In_3 v_~p2~0_Out_6) (= v_~n2~0_In_3 v_~n2~0_Out_6)))) InVars {~p2~0=v_~p2~0_In_3, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_In_3} OutVars{~p2~0=v_~p2~0_Out_6, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_Out_6} AuxVars[] AssignedVars[~n2~0, ~p2~0][352], [32#L105-1true, 131#L46-1true, Black: 570#(or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 776#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 774#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), Black: 542#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 580#(or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 813#true, 1468#true, 785#true, 82#L84-1true, Black: 148#(and (= (+ (* 4294967296 (div ~p2~0 4294967296)) ~p1~0) (+ (* 4294967296 (div ~p1~0 4294967296)) ~p2~0)) (= ~n1~0 ~n2~0)), 2537#(or (<= ~n1~0 0) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 1443#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 162#true, Black: 1439#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (< 0 ~n2~0)), Black: 1435#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 794#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 789#(<= ~n1~0 ~n2~0), Black: 1284#(or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 800#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 805#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 1437#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0))), Black: 819#(< 0 ~n2~0), Black: 802#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 798#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 ~n2~0)), Black: 1288#(or (<= ~n1~0 0) (< 0 ~n2~0)), Black: 1441#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1187#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 115#L132-4true, 141#true, Black: 1839#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), Black: 2097#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 28#L65-1true, Black: 2101#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1461#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0)), Black: 1457#(or (and (= 1 thread1Thread1of1ForFork1_~cond~0) (< 0 ~n1~0)) (and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0))), Black: 2093#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1463#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= thread2Thread1of1ForFork3_~cond~1 (* 256 (div thread2Thread1of1ForFork3_~cond~1 256))) (< 0 (+ (div thread2Thread1of1ForFork3_~cond~1 256) 1))), Black: 1915#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 2091#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2099#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))))]) [2021-12-16 03:10:10,814 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2021-12-16 03:10:10,814 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-16 03:10:10,814 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-16 03:10:10,815 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-16 03:10:10,850 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L104-->L105-1: Formula: (let ((.cse0 (< 1 v_~n2~0_In_3))) (or (and .cse0 (= v_~n2~0_Out_6 (+ v_~n2~0_In_3 (- 2))) (= v_~p2~0_Out_6 (+ v_~p2~0_In_3 (* v_~m~0_In_7 2)))) (and (not .cse0) (= v_~p2~0_In_3 v_~p2~0_Out_6) (= v_~n2~0_In_3 v_~n2~0_Out_6)))) InVars {~p2~0=v_~p2~0_In_3, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_In_3} OutVars{~p2~0=v_~p2~0_Out_6, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_Out_6} AuxVars[] AssignedVars[~n2~0, ~p2~0][455], [18#L133-2true, 32#L105-1true, Black: 570#(or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 776#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), 2496#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 774#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), Black: 580#(or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 69#L67-1true, 1461#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0)), 813#true, 785#true, 82#L84-1true, Black: 148#(and (= (+ (* 4294967296 (div ~p2~0 4294967296)) ~p1~0) (+ (* 4294967296 (div ~p1~0 4294967296)) ~p2~0)) (= ~n1~0 ~n2~0)), Black: 1443#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1439#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (< 0 ~n2~0)), Black: 794#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 1435#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 789#(<= ~n1~0 ~n2~0), Black: 1284#(or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 800#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 805#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 1437#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0))), Black: 802#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 819#(< 0 ~n2~0), Black: 798#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 ~n2~0)), Black: 1288#(or (<= ~n1~0 0) (< 0 ~n2~0)), 542#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 1441#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1187#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 141#true, Black: 1839#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), Black: 2097#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 1915#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 2101#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1457#(or (and (= 1 thread1Thread1of1ForFork1_~cond~0) (< 0 ~n1~0)) (and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0))), Black: 2093#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1463#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= thread2Thread1of1ForFork3_~cond~1 (* 256 (div thread2Thread1of1ForFork3_~cond~1 256))) (< 0 (+ (div thread2Thread1of1ForFork3_~cond~1 256) 1))), Black: 2091#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2099#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))))]) [2021-12-16 03:10:10,851 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2021-12-16 03:10:10,851 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-16 03:10:10,851 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-16 03:10:10,851 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-16 03:10:10,873 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L104-->L105-1: Formula: (let ((.cse0 (< 1 v_~n2~0_In_3))) (or (and .cse0 (= v_~n2~0_Out_6 (+ v_~n2~0_In_3 (- 2))) (= v_~p2~0_Out_6 (+ v_~p2~0_In_3 (* v_~m~0_In_7 2)))) (and (not .cse0) (= v_~p2~0_In_3 v_~p2~0_Out_6) (= v_~n2~0_In_3 v_~n2~0_Out_6)))) InVars {~p2~0=v_~p2~0_In_3, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_In_3} OutVars{~p2~0=v_~p2~0_Out_6, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_Out_6} AuxVars[] AssignedVars[~n2~0, ~p2~0][352], [18#L133-2true, 32#L105-1true, 1463#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= thread2Thread1of1ForFork3_~cond~1 (* 256 (div thread2Thread1of1ForFork3_~cond~1 256))) (< 0 (+ (div thread2Thread1of1ForFork3_~cond~1 256) 1))), Black: 570#(or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 776#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 774#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), Black: 542#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 580#(or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 813#true, 1468#true, 785#true, 82#L84-1true, Black: 148#(and (= (+ (* 4294967296 (div ~p2~0 4294967296)) ~p1~0) (+ (* 4294967296 (div ~p1~0 4294967296)) ~p2~0)) (= ~n1~0 ~n2~0)), 2537#(or (<= ~n1~0 0) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 1443#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 162#true, Black: 1439#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (< 0 ~n2~0)), Black: 1435#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 794#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 789#(<= ~n1~0 ~n2~0), Black: 1284#(or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 800#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 805#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 1437#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0))), Black: 802#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 819#(< 0 ~n2~0), Black: 798#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 ~n2~0)), Black: 1288#(or (<= ~n1~0 0) (< 0 ~n2~0)), Black: 1441#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1187#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 141#true, Black: 1839#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), Black: 2097#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 28#L65-1true, Black: 2101#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1461#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0)), Black: 2093#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1457#(or (and (= 1 thread1Thread1of1ForFork1_~cond~0) (< 0 ~n1~0)) (and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0))), Black: 1915#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 2091#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2099#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))))]) [2021-12-16 03:10:10,873 INFO L384 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2021-12-16 03:10:10,873 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-16 03:10:10,873 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-16 03:10:10,873 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-16 03:10:10,877 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L104-->L105-1: Formula: (let ((.cse0 (< 1 v_~n2~0_In_3))) (or (and .cse0 (= v_~n2~0_Out_6 (+ v_~n2~0_In_3 (- 2))) (= v_~p2~0_Out_6 (+ v_~p2~0_In_3 (* v_~m~0_In_7 2)))) (and (not .cse0) (= v_~p2~0_In_3 v_~p2~0_Out_6) (= v_~n2~0_In_3 v_~n2~0_Out_6)))) InVars {~p2~0=v_~p2~0_In_3, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_In_3} OutVars{~p2~0=v_~p2~0_Out_6, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_Out_6} AuxVars[] AssignedVars[~n2~0, ~p2~0][352], [18#L133-2true, 32#L105-1true, Black: 570#(or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 776#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 542#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 580#(or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 813#true, 1468#true, 785#true, 82#L84-1true, Black: 148#(and (= (+ (* 4294967296 (div ~p2~0 4294967296)) ~p1~0) (+ (* 4294967296 (div ~p1~0 4294967296)) ~p2~0)) (= ~n1~0 ~n2~0)), 2537#(or (<= ~n1~0 0) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 1443#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1439#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (< 0 ~n2~0)), Black: 1435#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 794#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 789#(<= ~n1~0 ~n2~0), Black: 1284#(or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 800#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 805#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 1437#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0))), Black: 802#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 819#(< 0 ~n2~0), Black: 798#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 ~n2~0)), Black: 1288#(or (<= ~n1~0 0) (< 0 ~n2~0)), Black: 1441#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1187#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 141#true, Black: 1839#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), Black: 2097#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 28#L65-1true, Black: 2101#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 774#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), Black: 1461#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0)), Black: 2093#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1457#(or (and (= 1 thread1Thread1of1ForFork1_~cond~0) (< 0 ~n1~0)) (and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0))), Black: 1915#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 1463#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= thread2Thread1of1ForFork3_~cond~1 (* 256 (div thread2Thread1of1ForFork3_~cond~1 256))) (< 0 (+ (div thread2Thread1of1ForFork3_~cond~1 256) 1))), Black: 2091#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2099#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))))]) [2021-12-16 03:10:10,877 INFO L384 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2021-12-16 03:10:10,877 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-16 03:10:10,877 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-16 03:10:10,877 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-16 03:10:10,936 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L104-->L105-1: Formula: (let ((.cse0 (< 1 v_~n2~0_In_3))) (or (and .cse0 (= v_~n2~0_Out_6 (+ v_~n2~0_In_3 (- 2))) (= v_~p2~0_Out_6 (+ v_~p2~0_In_3 (* v_~m~0_In_7 2)))) (and (not .cse0) (= v_~p2~0_In_3 v_~p2~0_Out_6) (= v_~n2~0_In_3 v_~n2~0_Out_6)))) InVars {~p2~0=v_~p2~0_In_3, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_In_3} OutVars{~p2~0=v_~p2~0_Out_6, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_Out_6} AuxVars[] AssignedVars[~n2~0, ~p2~0][424], [18#L133-2true, 32#L105-1true, 1463#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= thread2Thread1of1ForFork3_~cond~1 (* 256 (div thread2Thread1of1ForFork3_~cond~1 256))) (< 0 (+ (div thread2Thread1of1ForFork3_~cond~1 256) 1))), Black: 570#(or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 776#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 774#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), Black: 542#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 580#(or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 813#true, 785#true, 82#L84-1true, Black: 148#(and (= (+ (* 4294967296 (div ~p2~0 4294967296)) ~p1~0) (+ (* 4294967296 (div ~p1~0 4294967296)) ~p2~0)) (= ~n1~0 ~n2~0)), 120#L74true, 2537#(or (<= ~n1~0 0) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), 162#true, Black: 1443#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1439#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (< 0 ~n2~0)), Black: 794#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 1435#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 789#(<= ~n1~0 ~n2~0), Black: 1284#(or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 800#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 805#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 1437#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0))), Black: 802#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 819#(< 0 ~n2~0), Black: 798#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 ~n2~0)), Black: 1288#(or (<= ~n1~0 0) (< 0 ~n2~0)), Black: 1441#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1187#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 141#true, Black: 1839#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), Black: 2097#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 1915#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 1461#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0)), Black: 2101#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2093#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1457#(or (and (= 1 thread1Thread1of1ForFork1_~cond~0) (< 0 ~n1~0)) (and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0))), Black: 2091#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2099#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))))]) [2021-12-16 03:10:10,936 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-12-16 03:10:10,937 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2021-12-16 03:10:10,937 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2021-12-16 03:10:10,937 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2021-12-16 03:10:11,032 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L104-->L105-1: Formula: (let ((.cse0 (< 1 v_~n2~0_In_3))) (or (and .cse0 (= v_~n2~0_Out_6 (+ v_~n2~0_In_3 (- 2))) (= v_~p2~0_Out_6 (+ v_~p2~0_In_3 (* v_~m~0_In_7 2)))) (and (not .cse0) (= v_~p2~0_In_3 v_~p2~0_Out_6) (= v_~n2~0_In_3 v_~n2~0_Out_6)))) InVars {~p2~0=v_~p2~0_In_3, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_In_3} OutVars{~p2~0=v_~p2~0_Out_6, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_Out_6} AuxVars[] AssignedVars[~n2~0, ~p2~0][424], [18#L133-2true, 32#L105-1true, 1463#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= thread2Thread1of1ForFork3_~cond~1 (* 256 (div thread2Thread1of1ForFork3_~cond~1 256))) (< 0 (+ (div thread2Thread1of1ForFork3_~cond~1 256) 1))), Black: 570#(or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 776#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 774#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), Black: 542#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 580#(or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 813#true, 785#true, 82#L84-1true, Black: 148#(and (= (+ (* 4294967296 (div ~p2~0 4294967296)) ~p1~0) (+ (* 4294967296 (div ~p1~0 4294967296)) ~p2~0)) (= ~n1~0 ~n2~0)), 2537#(or (<= ~n1~0 0) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), 162#true, Black: 1443#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1439#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (< 0 ~n2~0)), Black: 794#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 1435#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 789#(<= ~n1~0 ~n2~0), Black: 800#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 1284#(or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 805#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 1437#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0))), Black: 802#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 819#(< 0 ~n2~0), Black: 798#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 ~n2~0)), Black: 1288#(or (<= ~n1~0 0) (< 0 ~n2~0)), Black: 1441#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1187#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 141#true, Black: 1839#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), Black: 2097#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 28#L65-1true, 1915#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 1461#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0)), Black: 2101#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2093#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1457#(or (and (= 1 thread1Thread1of1ForFork1_~cond~0) (< 0 ~n1~0)) (and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0))), Black: 2091#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2099#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))))]) [2021-12-16 03:10:11,032 INFO L384 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2021-12-16 03:10:11,033 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-16 03:10:11,033 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-16 03:10:11,033 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-16 03:10:11,118 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L104-->L105-1: Formula: (let ((.cse0 (< 1 v_~n2~0_In_3))) (or (and .cse0 (= v_~n2~0_Out_6 (+ v_~n2~0_In_3 (- 2))) (= v_~p2~0_Out_6 (+ v_~p2~0_In_3 (* v_~m~0_In_7 2)))) (and (not .cse0) (= v_~p2~0_In_3 v_~p2~0_Out_6) (= v_~n2~0_In_3 v_~n2~0_Out_6)))) InVars {~p2~0=v_~p2~0_In_3, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_In_3} OutVars{~p2~0=v_~p2~0_Out_6, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_Out_6} AuxVars[] AssignedVars[~n2~0, ~p2~0][352], [18#L133-2true, 32#L105-1true, Black: 570#(or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 776#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 774#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), Black: 542#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 580#(or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 813#true, 1468#true, 785#true, 82#L84-1true, Black: 148#(and (= (+ (* 4294967296 (div ~p2~0 4294967296)) ~p1~0) (+ (* 4294967296 (div ~p1~0 4294967296)) ~p2~0)) (= ~n1~0 ~n2~0)), 2537#(or (<= ~n1~0 0) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), 162#true, Black: 1443#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1439#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (< 0 ~n2~0)), Black: 1435#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 794#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 789#(<= ~n1~0 ~n2~0), Black: 800#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 1284#(or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 805#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 1437#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0))), Black: 819#(< 0 ~n2~0), Black: 802#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 798#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 ~n2~0)), Black: 1288#(or (<= ~n1~0 0) (< 0 ~n2~0)), Black: 1441#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1187#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 141#true, Black: 1839#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 28#L65-1true, Black: 2097#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1461#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0)), Black: 2101#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1457#(or (and (= 1 thread1Thread1of1ForFork1_~cond~0) (< 0 ~n1~0)) (and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0))), Black: 2093#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1463#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= thread2Thread1of1ForFork3_~cond~1 (* 256 (div thread2Thread1of1ForFork3_~cond~1 256))) (< 0 (+ (div thread2Thread1of1ForFork3_~cond~1 256) 1))), Black: 1915#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 2091#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2099#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))))]) [2021-12-16 03:10:11,118 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2021-12-16 03:10:11,118 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2021-12-16 03:10:11,118 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2021-12-16 03:10:11,118 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2021-12-16 03:10:11,495 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L104-->L105-1: Formula: (let ((.cse0 (< 1 v_~n2~0_In_3))) (or (and .cse0 (= v_~n2~0_Out_6 (+ v_~n2~0_In_3 (- 2))) (= v_~p2~0_Out_6 (+ v_~p2~0_In_3 (* v_~m~0_In_7 2)))) (and (not .cse0) (= v_~p2~0_In_3 v_~p2~0_Out_6) (= v_~n2~0_In_3 v_~n2~0_Out_6)))) InVars {~p2~0=v_~p2~0_In_3, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_In_3} OutVars{~p2~0=v_~p2~0_Out_6, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_Out_6} AuxVars[] AssignedVars[~n2~0, ~p2~0][352], [32#L105-1true, 1463#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= thread2Thread1of1ForFork3_~cond~1 (* 256 (div thread2Thread1of1ForFork3_~cond~1 256))) (< 0 (+ (div thread2Thread1of1ForFork3_~cond~1 256) 1))), Black: 570#(or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 776#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 774#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), Black: 542#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 580#(or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 813#true, 1468#true, 785#true, 82#L84-1true, Black: 148#(and (= (+ (* 4294967296 (div ~p2~0 4294967296)) ~p1~0) (+ (* 4294967296 (div ~p1~0 4294967296)) ~p2~0)) (= ~n1~0 ~n2~0)), 2537#(or (<= ~n1~0 0) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 1443#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 59#L134-2true, 162#true, Black: 1439#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (< 0 ~n2~0)), Black: 1435#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 794#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 789#(<= ~n1~0 ~n2~0), Black: 1284#(or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 800#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 805#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 1437#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0))), Black: 802#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 819#(< 0 ~n2~0), Black: 798#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 ~n2~0)), Black: 1288#(or (<= ~n1~0 0) (< 0 ~n2~0)), Black: 1441#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1187#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 141#true, Black: 1839#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), Black: 2097#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2101#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1461#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0)), Black: 2093#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1457#(or (and (= 1 thread1Thread1of1ForFork1_~cond~0) (< 0 ~n1~0)) (and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0))), Black: 1915#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 2091#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2099#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))))]) [2021-12-16 03:10:11,495 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-12-16 03:10:11,496 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-16 03:10:11,496 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-16 03:10:11,496 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-16 03:10:11,499 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L104-->L105-1: Formula: (let ((.cse0 (< 1 v_~n2~0_In_3))) (or (and .cse0 (= v_~n2~0_Out_6 (+ v_~n2~0_In_3 (- 2))) (= v_~p2~0_Out_6 (+ v_~p2~0_In_3 (* v_~m~0_In_7 2)))) (and (not .cse0) (= v_~p2~0_In_3 v_~p2~0_Out_6) (= v_~n2~0_In_3 v_~n2~0_Out_6)))) InVars {~p2~0=v_~p2~0_In_3, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_In_3} OutVars{~p2~0=v_~p2~0_Out_6, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_Out_6} AuxVars[] AssignedVars[~n2~0, ~p2~0][352], [32#L105-1true, Black: 570#(or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 776#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 542#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 580#(or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 813#true, 1468#true, 785#true, 82#L84-1true, Black: 148#(and (= (+ (* 4294967296 (div ~p2~0 4294967296)) ~p1~0) (+ (* 4294967296 (div ~p1~0 4294967296)) ~p2~0)) (= ~n1~0 ~n2~0)), 2537#(or (<= ~n1~0 0) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 1443#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 59#L134-2true, Black: 1439#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (< 0 ~n2~0)), Black: 1435#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 794#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 789#(<= ~n1~0 ~n2~0), Black: 1284#(or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 800#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 805#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 1437#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0))), Black: 802#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 819#(< 0 ~n2~0), Black: 798#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 ~n2~0)), Black: 1288#(or (<= ~n1~0 0) (< 0 ~n2~0)), Black: 1441#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1187#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 141#true, Black: 1839#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), Black: 2097#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2101#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 774#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), Black: 1461#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0)), Black: 2093#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1457#(or (and (= 1 thread1Thread1of1ForFork1_~cond~0) (< 0 ~n1~0)) (and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0))), Black: 1915#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 1463#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= thread2Thread1of1ForFork3_~cond~1 (* 256 (div thread2Thread1of1ForFork3_~cond~1 256))) (< 0 (+ (div thread2Thread1of1ForFork3_~cond~1 256) 1))), Black: 2091#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2099#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))))]) [2021-12-16 03:10:11,499 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-12-16 03:10:11,499 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-16 03:10:11,499 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-16 03:10:11,499 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-16 03:10:11,560 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L104-->L105-1: Formula: (let ((.cse0 (< 1 v_~n2~0_In_3))) (or (and .cse0 (= v_~n2~0_Out_6 (+ v_~n2~0_In_3 (- 2))) (= v_~p2~0_Out_6 (+ v_~p2~0_In_3 (* v_~m~0_In_7 2)))) (and (not .cse0) (= v_~p2~0_In_3 v_~p2~0_Out_6) (= v_~n2~0_In_3 v_~n2~0_Out_6)))) InVars {~p2~0=v_~p2~0_In_3, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_In_3} OutVars{~p2~0=v_~p2~0_Out_6, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_Out_6} AuxVars[] AssignedVars[~n2~0, ~p2~0][424], [32#L105-1true, 1463#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= thread2Thread1of1ForFork3_~cond~1 (* 256 (div thread2Thread1of1ForFork3_~cond~1 256))) (< 0 (+ (div thread2Thread1of1ForFork3_~cond~1 256) 1))), Black: 570#(or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 776#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 774#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), Black: 542#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 580#(or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 813#true, 785#true, 82#L84-1true, Black: 148#(and (= (+ (* 4294967296 (div ~p2~0 4294967296)) ~p1~0) (+ (* 4294967296 (div ~p1~0 4294967296)) ~p2~0)) (= ~n1~0 ~n2~0)), 2537#(or (<= ~n1~0 0) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), 162#true, Black: 1443#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 59#L134-2true, Black: 1439#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (< 0 ~n2~0)), Black: 794#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 1435#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 789#(<= ~n1~0 ~n2~0), Black: 800#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 1284#(or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 805#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 1437#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0))), Black: 802#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 819#(< 0 ~n2~0), Black: 798#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 ~n2~0)), Black: 1288#(or (<= ~n1~0 0) (< 0 ~n2~0)), Black: 1441#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1187#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 141#true, Black: 1839#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), Black: 2097#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 1915#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 1461#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0)), Black: 2101#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2093#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1457#(or (and (= 1 thread1Thread1of1ForFork1_~cond~0) (< 0 ~n1~0)) (and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0))), Black: 2091#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2099#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))))]) [2021-12-16 03:10:11,560 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-12-16 03:10:11,560 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-16 03:10:11,560 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-16 03:10:11,560 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-16 03:10:11,593 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L104-->L105-1: Formula: (let ((.cse0 (< 1 v_~n2~0_In_3))) (or (and .cse0 (= v_~n2~0_Out_6 (+ v_~n2~0_In_3 (- 2))) (= v_~p2~0_Out_6 (+ v_~p2~0_In_3 (* v_~m~0_In_7 2)))) (and (not .cse0) (= v_~p2~0_In_3 v_~p2~0_Out_6) (= v_~n2~0_In_3 v_~n2~0_Out_6)))) InVars {~p2~0=v_~p2~0_In_3, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_In_3} OutVars{~p2~0=v_~p2~0_Out_6, ~m~0=v_~m~0_In_7, ~n2~0=v_~n2~0_Out_6} AuxVars[] AssignedVars[~n2~0, ~p2~0][352], [32#L105-1true, Black: 570#(or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 776#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 774#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), Black: 542#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 580#(or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 813#true, 1468#true, 785#true, 82#L84-1true, Black: 148#(and (= (+ (* 4294967296 (div ~p2~0 4294967296)) ~p1~0) (+ (* 4294967296 (div ~p1~0 4294967296)) ~p2~0)) (= ~n1~0 ~n2~0)), 2537#(or (<= ~n1~0 0) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 1443#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 162#true, 59#L134-2true, Black: 1439#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (< 0 ~n2~0)), Black: 1435#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 794#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 789#(<= ~n1~0 ~n2~0), Black: 1284#(or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 800#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 805#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 1437#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0))), Black: 819#(< 0 ~n2~0), Black: 802#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 798#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 ~n2~0)), Black: 1288#(or (<= ~n1~0 0) (< 0 ~n2~0)), Black: 1441#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1187#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 141#true, Black: 1839#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), Black: 2097#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2101#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1461#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0)), Black: 1457#(or (and (= 1 thread1Thread1of1ForFork1_~cond~0) (< 0 ~n1~0)) (and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0))), Black: 2093#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1463#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= thread2Thread1of1ForFork3_~cond~1 (* 256 (div thread2Thread1of1ForFork3_~cond~1 256))) (< 0 (+ (div thread2Thread1of1ForFork3_~cond~1 256) 1))), Black: 1915#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 2091#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2099#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))))]) [2021-12-16 03:10:11,594 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2021-12-16 03:10:11,594 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-16 03:10:11,594 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-16 03:10:11,594 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-16 03:10:11,807 INFO L129 PetriNetUnfolder]: 10866/29042 cut-off events. [2021-12-16 03:10:11,808 INFO L130 PetriNetUnfolder]: For 179808/187802 co-relation queries the response was YES. [2021-12-16 03:10:11,998 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113329 conditions, 29042 events. 10866/29042 cut-off events. For 179808/187802 co-relation queries the response was YES. Maximal size of possible extension queue 1652. Compared 349097 event pairs, 1276 based on Foata normal form. 1476/28226 useless extension candidates. Maximal degree in co-relation 113291. Up to 7037 conditions per place. [2021-12-16 03:10:12,130 INFO L132 encePairwiseOnDemand]: 124/135 looper letters, 410 selfloop transitions, 81 changer transitions 0/604 dead transitions. [2021-12-16 03:10:12,130 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 604 transitions, 7895 flow [2021-12-16 03:10:12,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 03:10:12,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-16 03:10:12,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 697 transitions. [2021-12-16 03:10:12,132 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8604938271604938 [2021-12-16 03:10:12,132 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 697 transitions. [2021-12-16 03:10:12,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 697 transitions. [2021-12-16 03:10:12,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:10:12,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 697 transitions. [2021-12-16 03:10:12,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:10:12,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 135.0) internal successors, (945), 7 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:10:12,135 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 135.0) internal successors, (945), 7 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:10:12,135 INFO L186 Difference]: Start difference. First operand has 183 places, 318 transitions, 3103 flow. Second operand 6 states and 697 transitions. [2021-12-16 03:10:12,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 604 transitions, 7895 flow [2021-12-16 03:10:13,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 604 transitions, 7700 flow, removed 76 selfloop flow, removed 4 redundant places. [2021-12-16 03:10:13,571 INFO L242 Difference]: Finished difference. Result has 188 places, 357 transitions, 3885 flow [2021-12-16 03:10:13,572 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=3004, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3885, PETRI_PLACES=188, PETRI_TRANSITIONS=357} [2021-12-16 03:10:13,572 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 67 predicate places. [2021-12-16 03:10:13,572 INFO L470 AbstractCegarLoop]: Abstraction has has 188 places, 357 transitions, 3885 flow [2021-12-16 03:10:13,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:10:13,573 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:10:13,573 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:10:13,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-16 03:10:13,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:10:13,791 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-16 03:10:13,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:10:13,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1907493370, now seen corresponding path program 6 times [2021-12-16 03:10:13,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:10:13,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661222864] [2021-12-16 03:10:13,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:10:13,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:10:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:10:13,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 03:10:13,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:10:13,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661222864] [2021-12-16 03:10:13,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661222864] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:10:13,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70948259] [2021-12-16 03:10:13,988 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-16 03:10:13,988 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:10:13,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:10:13,989 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 03:10:13,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-16 03:10:14,076 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-12-16 03:10:14,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 03:10:14,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-16 03:10:14,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:10:14,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 03:10:14,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 03:10:14,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 03:10:14,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70948259] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-16 03:10:14,765 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-16 03:10:14,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 19 [2021-12-16 03:10:14,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964919262] [2021-12-16 03:10:14,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:10:14,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 03:10:14,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:10:14,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 03:10:14,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2021-12-16 03:10:14,768 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 135 [2021-12-16 03:10:14,768 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 357 transitions, 3885 flow. Second operand has 8 states, 8 states have (on average 93.625) internal successors, (749), 8 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:10:14,768 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:10:14,769 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 135 [2021-12-16 03:10:14,769 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:10:17,209 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([359] L55-->L47: Formula: (not (= 0 (mod v_thread1Thread1of1ForFork1_~cond~0_5 256))) InVars {thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} OutVars{thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} AuxVars[] AssignedVars[][413], [91#L112true, Black: 570#(or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), 2496#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 776#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 774#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), 798#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 ~n2~0)), Black: 542#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), 1439#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (< 0 ~n2~0)), 1457#(or (and (= 1 thread1Thread1of1ForFork1_~cond~0) (< 0 ~n1~0)) (and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0))), 92#L85true, Black: 148#(and (= (+ (* 4294967296 (div ~p2~0 4294967296)) ~p1~0) (+ (* 4294967296 (div ~p1~0 4294967296)) ~p2~0)) (= ~n1~0 ~n2~0)), 3355#(and (< 0 ~n2~0) (< 0 (mod thread4Thread1of1ForFork2_~cond~3 256))), Black: 1443#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2110#true, Black: 2537#(or (<= ~n1~0 0) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 2722#(and (or (<= ~n1~0 0) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), Black: 1435#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 794#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 813#true, Black: 789#(<= ~n1~0 ~n2~0), Black: 1284#(or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 800#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 1437#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0))), Black: 805#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 802#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 819#(< 0 ~n2~0), Black: 1288#(or (<= ~n1~0 0) (< 0 ~n2~0)), Black: 1441#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1187#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 34#L47true, 115#L132-4true, 2097#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 141#true, Black: 1839#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 28#L65-1true, Black: 2101#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1461#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0)), Black: 2093#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1463#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= thread2Thread1of1ForFork3_~cond~1 (* 256 (div thread2Thread1of1ForFork3_~cond~1 256))) (< 0 (+ (div thread2Thread1of1ForFork3_~cond~1 256) 1))), Black: 1915#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 2091#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2099#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 580#(or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))]) [2021-12-16 03:10:17,209 INFO L384 tUnfolder$Statistics]: this new event has 71 ancestors and is not cut-off event [2021-12-16 03:10:17,209 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2021-12-16 03:10:17,209 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2021-12-16 03:10:17,209 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2021-12-16 03:10:17,806 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([359] L55-->L47: Formula: (not (= 0 (mod v_thread1Thread1of1ForFork1_~cond~0_5 256))) InVars {thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} OutVars{thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} AuxVars[] AssignedVars[][413], [Black: 570#(or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), 2496#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 776#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 774#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), 798#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 ~n2~0)), Black: 542#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), 1439#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (< 0 ~n2~0)), 1457#(or (and (= 1 thread1Thread1of1ForFork1_~cond~0) (< 0 ~n1~0)) (and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0))), 92#L85true, Black: 148#(and (= (+ (* 4294967296 (div ~p2~0 4294967296)) ~p1~0) (+ (* 4294967296 (div ~p1~0 4294967296)) ~p2~0)) (= ~n1~0 ~n2~0)), 3355#(and (< 0 ~n2~0) (< 0 (mod thread4Thread1of1ForFork2_~cond~3 256))), Black: 1443#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2110#true, Black: 2537#(or (<= ~n1~0 0) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 2722#(and (or (<= ~n1~0 0) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), Black: 1435#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 794#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), 16#L104true, Black: 813#true, Black: 789#(<= ~n1~0 ~n2~0), Black: 800#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 1284#(or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 805#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 1437#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0))), Black: 802#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 819#(< 0 ~n2~0), Black: 1288#(or (<= ~n1~0 0) (< 0 ~n2~0)), Black: 1441#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1187#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 34#L47true, 115#L132-4true, 2097#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 141#true, Black: 1839#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 28#L65-1true, Black: 2101#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1461#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0)), Black: 2093#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1915#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 1463#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= thread2Thread1of1ForFork3_~cond~1 (* 256 (div thread2Thread1of1ForFork3_~cond~1 256))) (< 0 (+ (div thread2Thread1of1ForFork3_~cond~1 256) 1))), Black: 2091#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2099#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 580#(or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))]) [2021-12-16 03:10:17,806 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is not cut-off event [2021-12-16 03:10:17,807 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is not cut-off event [2021-12-16 03:10:17,807 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is not cut-off event [2021-12-16 03:10:17,807 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is not cut-off event [2021-12-16 03:10:18,825 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([359] L55-->L47: Formula: (not (= 0 (mod v_thread1Thread1of1ForFork1_~cond~0_5 256))) InVars {thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} OutVars{thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} AuxVars[] AssignedVars[][395], [3085#(< 0 (mod thread4Thread1of1ForFork2_~cond~3 256)), Black: 570#(or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), Black: 776#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), 2496#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), Black: 774#(and (or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), Black: 542#(< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)), 813#true, 1468#true, 1457#(or (and (= 1 thread1Thread1of1ForFork1_~cond~0) (< 0 ~n1~0)) (and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0))), 785#true, 82#L84-1true, Black: 148#(and (= (+ (* 4294967296 (div ~p2~0 4294967296)) ~p1~0) (+ (* 4294967296 (div ~p1~0 4294967296)) ~p2~0)) (= ~n1~0 ~n2~0)), Black: 2110#true, Black: 1443#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1439#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (< 0 ~n2~0)), Black: 2537#(or (<= ~n1~0 0) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))), 16#L104true, Black: 2722#(and (or (<= ~n1~0 0) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256))) (or (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)) (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)))), Black: 1435#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 794#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 789#(<= ~n1~0 ~n2~0), Black: 1284#(or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 800#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 1437#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0))), Black: 805#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 819#(< 0 ~n2~0), Black: 802#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= ~n1~0 ~n2~0)), Black: 1288#(or (<= ~n1~0 0) (< 0 ~n2~0)), Black: 798#(and (or (and (= 0 thread3Thread1of1ForFork0_~cond~2) (<= ~n2~0 0)) (and (< 0 ~n2~0) (= 1 thread3Thread1of1ForFork0_~cond~2))) (<= ~n1~0 ~n2~0)), Black: 1441#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1187#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), 115#L132-4true, 34#L47true, 141#true, Black: 1839#(< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)), Black: 2097#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 28#L65-1true, Black: 1461#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0)), Black: 2101#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2093#(and (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 1463#(and (<= ~n1~0 0) (= 0 thread1Thread1of1ForFork1_~cond~0) (<= thread2Thread1of1ForFork3_~cond~1 (* 256 (div thread2Thread1of1ForFork3_~cond~1 256))) (< 0 (+ (div thread2Thread1of1ForFork3_~cond~1 256) 1))), Black: 1915#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 2091#(and (or (<= ~n1~0 0) (< 0 ~n2~0)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 2099#(and (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (or (< 0 ~n2~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 580#(or (< 0 ~n1~0) (= 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))]) [2021-12-16 03:10:18,825 INFO L384 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2021-12-16 03:10:18,825 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2021-12-16 03:10:18,825 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-12-16 03:10:18,825 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2021-12-16 03:10:23,993 INFO L129 PetriNetUnfolder]: 26291/58504 cut-off events. [2021-12-16 03:10:23,994 INFO L130 PetriNetUnfolder]: For 367264/372904 co-relation queries the response was YES. [2021-12-16 03:10:24,724 INFO L84 FinitePrefix]: Finished finitePrefix Result has 237385 conditions, 58504 events. 26291/58504 cut-off events. For 367264/372904 co-relation queries the response was YES. Maximal size of possible extension queue 3276. Compared 696999 event pairs, 1438 based on Foata normal form. 1340/55804 useless extension candidates. Maximal degree in co-relation 237343. Up to 9902 conditions per place. [2021-12-16 03:10:25,109 INFO L132 encePairwiseOnDemand]: 121/135 looper letters, 382 selfloop transitions, 214 changer transitions 0/703 dead transitions. [2021-12-16 03:10:25,109 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 703 transitions, 9245 flow [2021-12-16 03:10:25,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 03:10:25,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-16 03:10:25,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1340 transitions. [2021-12-16 03:10:25,113 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7635327635327636 [2021-12-16 03:10:25,113 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1340 transitions. [2021-12-16 03:10:25,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1340 transitions. [2021-12-16 03:10:25,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:10:25,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1340 transitions. [2021-12-16 03:10:25,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 103.07692307692308) internal successors, (1340), 13 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:10:25,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:10:25,120 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:10:25,120 INFO L186 Difference]: Start difference. First operand has 188 places, 357 transitions, 3885 flow. Second operand 13 states and 1340 transitions. [2021-12-16 03:10:25,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 703 transitions, 9245 flow [2021-12-16 03:10:28,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 703 transitions, 9227 flow, removed 9 selfloop flow, removed 0 redundant places. [2021-12-16 03:10:28,107 INFO L242 Difference]: Finished difference. Result has 204 places, 439 transitions, 5767 flow [2021-12-16 03:10:28,108 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=3881, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5767, PETRI_PLACES=204, PETRI_TRANSITIONS=439} [2021-12-16 03:10:28,108 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 83 predicate places. [2021-12-16 03:10:28,108 INFO L470 AbstractCegarLoop]: Abstraction has has 204 places, 439 transitions, 5767 flow [2021-12-16 03:10:28,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.625) internal successors, (749), 8 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:10:28,109 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:10:28,109 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:10:28,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-16 03:10:28,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:10:28,310 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-16 03:10:28,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:10:28,311 INFO L85 PathProgramCache]: Analyzing trace with hash -743094412, now seen corresponding path program 7 times [2021-12-16 03:10:28,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:10:28,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114422868] [2021-12-16 03:10:28,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:10:28,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:10:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:10:28,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 03:10:28,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:10:28,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114422868] [2021-12-16 03:10:28,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114422868] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:10:28,438 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:10:28,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 03:10:28,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246785076] [2021-12-16 03:10:28,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:10:28,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 03:10:28,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:10:28,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 03:10:28,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-16 03:10:28,440 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 135 [2021-12-16 03:10:28,441 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 439 transitions, 5767 flow. Second operand has 9 states, 9 states have (on average 91.33333333333333) internal successors, (822), 9 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:10:28,441 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:10:28,441 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 135 [2021-12-16 03:10:28,441 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:10:47,903 INFO L129 PetriNetUnfolder]: 50956/106631 cut-off events. [2021-12-16 03:10:47,904 INFO L130 PetriNetUnfolder]: For 731698/735857 co-relation queries the response was YES. [2021-12-16 03:10:49,243 INFO L84 FinitePrefix]: Finished finitePrefix Result has 474864 conditions, 106631 events. 50956/106631 cut-off events. For 731698/735857 co-relation queries the response was YES. Maximal size of possible extension queue 6209. Compared 1316783 event pairs, 6371 based on Foata normal form. 820/104811 useless extension candidates. Maximal degree in co-relation 474817. Up to 28426 conditions per place. [2021-12-16 03:10:50,138 INFO L132 encePairwiseOnDemand]: 117/135 looper letters, 1248 selfloop transitions, 280 changer transitions 0/1613 dead transitions. [2021-12-16 03:10:50,139 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 1613 transitions, 25266 flow [2021-12-16 03:10:50,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-16 03:10:50,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-12-16 03:10:50,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2283 transitions. [2021-12-16 03:10:50,145 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7686868686868686 [2021-12-16 03:10:50,145 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2283 transitions. [2021-12-16 03:10:50,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2283 transitions. [2021-12-16 03:10:50,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:10:50,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2283 transitions. [2021-12-16 03:10:50,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 103.77272727272727) internal successors, (2283), 22 states have internal predecessors, (2283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:10:50,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 135.0) internal successors, (3105), 23 states have internal predecessors, (3105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:10:50,156 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 135.0) internal successors, (3105), 23 states have internal predecessors, (3105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:10:50,157 INFO L186 Difference]: Start difference. First operand has 204 places, 439 transitions, 5767 flow. Second operand 22 states and 2283 transitions. [2021-12-16 03:10:50,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 1613 transitions, 25266 flow