./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa --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 0d10bf8c0e842192a13f4b6638f03cf57668d5bee07d0b49c4b595de1c605066 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 00:12:12,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 00:12:12,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 00:12:12,331 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 00:12:12,331 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 00:12:12,332 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 00:12:12,333 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 00:12:12,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 00:12:12,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 00:12:12,337 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 00:12:12,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 00:12:12,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 00:12:12,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 00:12:12,341 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 00:12:12,342 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 00:12:12,343 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 00:12:12,344 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 00:12:12,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 00:12:12,346 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 00:12:12,348 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 00:12:12,350 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 00:12:12,351 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 00:12:12,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 00:12:12,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 00:12:12,355 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 00:12:12,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 00:12:12,356 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 00:12:12,357 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 00:12:12,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 00:12:12,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 00:12:12,359 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 00:12:12,359 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 00:12:12,360 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 00:12:12,361 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 00:12:12,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 00:12:12,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 00:12:12,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 00:12:12,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 00:12:12,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 00:12:12,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 00:12:12,363 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 00:12:12,364 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-07 00:12:12,382 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 00:12:12,382 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 00:12:12,382 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 00:12:12,382 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 00:12:12,383 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 00:12:12,383 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 00:12:12,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 00:12:12,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 00:12:12,383 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 00:12:12,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 00:12:12,384 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-07 00:12:12,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-07 00:12:12,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-07 00:12:12,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 00:12:12,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-07 00:12:12,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 00:12:12,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-07 00:12:12,384 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-07 00:12:12,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-07 00:12:12,385 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 00:12:12,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-07 00:12:12,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 00:12:12,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 00:12:12,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 00:12:12,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 00:12:12,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 00:12:12,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 00:12:12,386 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-07 00:12:12,386 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-07 00:12:12,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-07 00:12:12,386 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-07 00:12:12,386 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-07 00:12:12,386 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-07 00:12:12,386 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 00:12:12,386 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa 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 -> 0d10bf8c0e842192a13f4b6638f03cf57668d5bee07d0b49c4b595de1c605066 [2021-12-07 00:12:12,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 00:12:12,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 00:12:12,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 00:12:12,589 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 00:12:12,589 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 00:12:12,590 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c [2021-12-07 00:12:12,633 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/data/670e63a1a/41c6edb70aab459cb1041d99de529933/FLAG3b53a0947 [2021-12-07 00:12:13,015 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 00:12:13,016 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c [2021-12-07 00:12:13,021 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/data/670e63a1a/41c6edb70aab459cb1041d99de529933/FLAG3b53a0947 [2021-12-07 00:12:13,030 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/data/670e63a1a/41c6edb70aab459cb1041d99de529933 [2021-12-07 00:12:13,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 00:12:13,033 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 00:12:13,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 00:12:13,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 00:12:13,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 00:12:13,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:12:13" (1/1) ... [2021-12-07 00:12:13,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16b4bf65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:12:13, skipping insertion in model container [2021-12-07 00:12:13,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:12:13" (1/1) ... [2021-12-07 00:12:13,045 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 00:12:13,058 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 00:12:13,190 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c[2135,2148] [2021-12-07 00:12:13,193 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 00:12:13,198 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 00:12:13,213 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c[2135,2148] [2021-12-07 00:12:13,214 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 00:12:13,223 INFO L208 MainTranslator]: Completed translation [2021-12-07 00:12:13,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:12:13 WrapperNode [2021-12-07 00:12:13,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 00:12:13,225 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 00:12:13,225 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 00:12:13,225 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 00:12:13,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:12:13" (1/1) ... [2021-12-07 00:12:13,239 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:12:13" (1/1) ... [2021-12-07 00:12:13,258 INFO L137 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2021-12-07 00:12:13,259 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 00:12:13,259 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 00:12:13,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 00:12:13,260 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 00:12:13,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:12:13" (1/1) ... [2021-12-07 00:12:13,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:12:13" (1/1) ... [2021-12-07 00:12:13,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:12:13" (1/1) ... [2021-12-07 00:12:13,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:12:13" (1/1) ... [2021-12-07 00:12:13,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:12:13" (1/1) ... [2021-12-07 00:12:13,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:12:13" (1/1) ... [2021-12-07 00:12:13,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:12:13" (1/1) ... [2021-12-07 00:12:13,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 00:12:13,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 00:12:13,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 00:12:13,286 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 00:12:13,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:12:13" (1/1) ... [2021-12-07 00:12:13,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 00:12:13,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:12:13,312 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-07 00:12:13,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-07 00:12:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-07 00:12:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-12-07 00:12:13,352 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-12-07 00:12:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-12-07 00:12:13,352 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-12-07 00:12:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-12-07 00:12:13,352 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-12-07 00:12:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-07 00:12:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-07 00:12:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-07 00:12:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 00:12:13,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 00:12:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-07 00:12:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-07 00:12:13,355 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-07 00:12:13,427 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 00:12:13,429 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 00:12:13,571 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 00:12:13,579 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 00:12:13,579 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-07 00:12:13,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:12:13 BoogieIcfgContainer [2021-12-07 00:12:13,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 00:12:13,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-07 00:12:13,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-07 00:12:13,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-07 00:12:13,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:12:13" (1/3) ... [2021-12-07 00:12:13,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92cb0d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:12:13, skipping insertion in model container [2021-12-07 00:12:13,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:12:13" (2/3) ... [2021-12-07 00:12:13,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92cb0d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:12:13, skipping insertion in model container [2021-12-07 00:12:13,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:12:13" (3/3) ... [2021-12-07 00:12:13,590 INFO L111 eAbstractionObserver]: Analyzing ICFG mult-flipped-dist.wvr.c [2021-12-07 00:12:13,595 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-07 00:12:13,595 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-07 00:12:13,595 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-07 00:12:13,596 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-07 00:12:13,623 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,624 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,624 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,625 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,625 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,625 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,625 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,626 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,626 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,626 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,626 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,627 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,627 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,627 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,627 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,627 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,628 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,628 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,628 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,628 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,629 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,629 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,629 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,630 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,630 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,630 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,630 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,631 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,631 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,631 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,631 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,632 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,632 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,632 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,632 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,632 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,633 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,633 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,633 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,633 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,634 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,634 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,634 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,635 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,635 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,635 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,635 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,636 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,636 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,636 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,636 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,637 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,637 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,637 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,637 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,637 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,638 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,638 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,638 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,638 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,642 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,642 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,642 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,643 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,646 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,646 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,646 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,646 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,648 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,648 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,648 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,649 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:12:13,653 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-12-07 00:12:13,695 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-07 00:12:13,703 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-07 00:12:13,703 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-12-07 00:12:13,717 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 110 places, 107 transitions, 238 flow [2021-12-07 00:12:13,770 INFO L129 PetriNetUnfolder]: 7/104 cut-off events. [2021-12-07 00:12:13,771 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-07 00:12:13,775 INFO L84 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 104 events. 7/104 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2021-12-07 00:12:13,775 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 107 transitions, 238 flow [2021-12-07 00:12:13,780 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 93 transitions, 204 flow [2021-12-07 00:12:13,808 INFO L129 PetriNetUnfolder]: 7/92 cut-off events. [2021-12-07 00:12:13,808 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-07 00:12:13,808 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:12:13,809 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] [2021-12-07 00:12:13,810 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-07 00:12:13,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:12:13,815 INFO L85 PathProgramCache]: Analyzing trace with hash 588643027, now seen corresponding path program 1 times [2021-12-07 00:12:13,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:12:13,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191100162] [2021-12-07 00:12:13,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:12:13,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:12:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:12:13,995 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-07 00:12:13,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:12:13,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191100162] [2021-12-07 00:12:13,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191100162] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:12:13,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:12:13,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 00:12:13,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759417194] [2021-12-07 00:12:13,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:12:14,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-07 00:12:14,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:12:14,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-07 00:12:14,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-07 00:12:14,028 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 107 [2021-12-07 00:12:14,030 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 93 transitions, 204 flow. Second operand has 2 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 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-07 00:12:14,030 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:12:14,030 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 107 [2021-12-07 00:12:14,031 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:12:14,059 INFO L129 PetriNetUnfolder]: 3/89 cut-off events. [2021-12-07 00:12:14,059 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-12-07 00:12:14,060 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 89 events. 3/89 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 10/95 useless extension candidates. Maximal degree in co-relation 66. Up to 7 conditions per place. [2021-12-07 00:12:14,061 INFO L132 encePairwiseOnDemand]: 103/107 looper letters, 6 selfloop transitions, 0 changer transitions 1/89 dead transitions. [2021-12-07 00:12:14,061 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 89 transitions, 208 flow [2021-12-07 00:12:14,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-07 00:12:14,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-12-07 00:12:14,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 202 transitions. [2021-12-07 00:12:14,071 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9439252336448598 [2021-12-07 00:12:14,072 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 202 transitions. [2021-12-07 00:12:14,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 202 transitions. [2021-12-07 00:12:14,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:12:14,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 202 transitions. [2021-12-07 00:12:14,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 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-07 00:12:14,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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-07 00:12:14,081 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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-07 00:12:14,083 INFO L186 Difference]: Start difference. First operand has 96 places, 93 transitions, 204 flow. Second operand 2 states and 202 transitions. [2021-12-07 00:12:14,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 89 transitions, 208 flow [2021-12-07 00:12:14,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 89 transitions, 196 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-12-07 00:12:14,089 INFO L242 Difference]: Finished difference. Result has 91 places, 88 transitions, 182 flow [2021-12-07 00:12:14,090 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=182, PETRI_PLACES=91, PETRI_TRANSITIONS=88} [2021-12-07 00:12:14,093 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, -5 predicate places. [2021-12-07 00:12:14,093 INFO L470 AbstractCegarLoop]: Abstraction has has 91 places, 88 transitions, 182 flow [2021-12-07 00:12:14,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 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-07 00:12:14,094 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:12:14,094 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] [2021-12-07 00:12:14,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-07 00:12:14,094 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-07 00:12:14,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:12:14,095 INFO L85 PathProgramCache]: Analyzing trace with hash -129768965, now seen corresponding path program 1 times [2021-12-07 00:12:14,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:12:14,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495391361] [2021-12-07 00:12:14,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:12:14,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:12:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:12:14,288 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-07 00:12:14,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:12:14,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495391361] [2021-12-07 00:12:14,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495391361] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:12:14,289 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:12:14,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 00:12:14,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402845627] [2021-12-07 00:12:14,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:12:14,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 00:12:14,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:12:14,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 00:12:14,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-07 00:12:14,293 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2021-12-07 00:12:14,294 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 88 transitions, 182 flow. Second operand has 7 states, 7 states have (on average 86.85714285714286) internal successors, (608), 7 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:12:14,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:12:14,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2021-12-07 00:12:14,294 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:12:14,408 INFO L129 PetriNetUnfolder]: 53/322 cut-off events. [2021-12-07 00:12:14,408 INFO L130 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2021-12-07 00:12:14,410 INFO L84 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 322 events. 53/322 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1267 event pairs, 7 based on Foata normal form. 2/290 useless extension candidates. Maximal degree in co-relation 432. Up to 52 conditions per place. [2021-12-07 00:12:14,412 INFO L132 encePairwiseOnDemand]: 98/107 looper letters, 35 selfloop transitions, 9 changer transitions 4/120 dead transitions. [2021-12-07 00:12:14,412 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 120 transitions, 354 flow [2021-12-07 00:12:14,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 00:12:14,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-07 00:12:14,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 644 transitions. [2021-12-07 00:12:14,417 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8598130841121495 [2021-12-07 00:12:14,417 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 644 transitions. [2021-12-07 00:12:14,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 644 transitions. [2021-12-07 00:12:14,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:12:14,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 644 transitions. [2021-12-07 00:12:14,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:12:14,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 107.0) internal successors, (856), 8 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:12:14,426 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 107.0) internal successors, (856), 8 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:12:14,426 INFO L186 Difference]: Start difference. First operand has 91 places, 88 transitions, 182 flow. Second operand 7 states and 644 transitions. [2021-12-07 00:12:14,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 120 transitions, 354 flow [2021-12-07 00:12:14,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 120 transitions, 354 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-07 00:12:14,429 INFO L242 Difference]: Finished difference. Result has 100 places, 94 transitions, 235 flow [2021-12-07 00:12:14,429 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=235, PETRI_PLACES=100, PETRI_TRANSITIONS=94} [2021-12-07 00:12:14,430 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 4 predicate places. [2021-12-07 00:12:14,430 INFO L470 AbstractCegarLoop]: Abstraction has has 100 places, 94 transitions, 235 flow [2021-12-07 00:12:14,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.85714285714286) internal successors, (608), 7 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:12:14,431 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:12:14,431 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] [2021-12-07 00:12:14,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-07 00:12:14,431 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-07 00:12:14,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:12:14,432 INFO L85 PathProgramCache]: Analyzing trace with hash 891063948, now seen corresponding path program 1 times [2021-12-07 00:12:14,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:12:14,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034108832] [2021-12-07 00:12:14,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:12:14,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:12:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:12:14,537 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-07 00:12:14,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:12:14,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034108832] [2021-12-07 00:12:14,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034108832] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:12:14,538 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:12:14,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 00:12:14,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49058063] [2021-12-07 00:12:14,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:12:14,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 00:12:14,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:12:14,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 00:12:14,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-07 00:12:14,541 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2021-12-07 00:12:14,543 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 94 transitions, 235 flow. Second operand has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 0 states have call successors, (0), 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-07 00:12:14,543 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:12:14,543 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2021-12-07 00:12:14,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:12:14,898 INFO L129 PetriNetUnfolder]: 877/2022 cut-off events. [2021-12-07 00:12:14,898 INFO L130 PetriNetUnfolder]: For 171/172 co-relation queries the response was YES. [2021-12-07 00:12:14,905 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3675 conditions, 2022 events. 877/2022 cut-off events. For 171/172 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 14780 event pairs, 392 based on Foata normal form. 0/1584 useless extension candidates. Maximal degree in co-relation 3667. Up to 807 conditions per place. [2021-12-07 00:12:14,917 INFO L132 encePairwiseOnDemand]: 99/107 looper letters, 40 selfloop transitions, 6 changer transitions 0/120 dead transitions. [2021-12-07 00:12:14,917 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 120 transitions, 387 flow [2021-12-07 00:12:14,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 00:12:14,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-07 00:12:14,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 542 transitions. [2021-12-07 00:12:14,920 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8442367601246106 [2021-12-07 00:12:14,920 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 542 transitions. [2021-12-07 00:12:14,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 542 transitions. [2021-12-07 00:12:14,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:12:14,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 542 transitions. [2021-12-07 00:12:14,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 0 states have call successors, (0), 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-07 00:12:14,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 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-07 00:12:14,926 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 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-07 00:12:14,926 INFO L186 Difference]: Start difference. First operand has 100 places, 94 transitions, 235 flow. Second operand 6 states and 542 transitions. [2021-12-07 00:12:14,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 120 transitions, 387 flow [2021-12-07 00:12:14,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 120 transitions, 383 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-12-07 00:12:14,933 INFO L242 Difference]: Finished difference. Result has 104 places, 97 transitions, 269 flow [2021-12-07 00:12:14,933 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=269, PETRI_PLACES=104, PETRI_TRANSITIONS=97} [2021-12-07 00:12:14,934 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 8 predicate places. [2021-12-07 00:12:14,934 INFO L470 AbstractCegarLoop]: Abstraction has has 104 places, 97 transitions, 269 flow [2021-12-07 00:12:14,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 0 states have call successors, (0), 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-07 00:12:14,935 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:12:14,935 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] [2021-12-07 00:12:14,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-07 00:12:14,935 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-07 00:12:14,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:12:14,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1819342954, now seen corresponding path program 2 times [2021-12-07 00:12:14,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:12:14,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534579696] [2021-12-07 00:12:14,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:12:14,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:12:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:12:15,028 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-07 00:12:15,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:12:15,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534579696] [2021-12-07 00:12:15,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534579696] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:12:15,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:12:15,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:12:15,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165128895] [2021-12-07 00:12:15,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:12:15,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 00:12:15,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:12:15,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:12:15,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:12:15,032 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2021-12-07 00:12:15,033 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 97 transitions, 269 flow. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 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-07 00:12:15,033 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:12:15,039 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2021-12-07 00:12:15,040 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:12:15,304 INFO L129 PetriNetUnfolder]: 901/2408 cut-off events. [2021-12-07 00:12:15,305 INFO L130 PetriNetUnfolder]: For 1120/1233 co-relation queries the response was YES. [2021-12-07 00:12:15,316 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5073 conditions, 2408 events. 901/2408 cut-off events. For 1120/1233 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 20139 event pairs, 347 based on Foata normal form. 96/2344 useless extension candidates. Maximal degree in co-relation 5063. Up to 915 conditions per place. [2021-12-07 00:12:15,329 INFO L132 encePairwiseOnDemand]: 101/107 looper letters, 33 selfloop transitions, 5 changer transitions 2/119 dead transitions. [2021-12-07 00:12:15,329 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 119 transitions, 426 flow [2021-12-07 00:12:15,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 00:12:15,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-07 00:12:15,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 379 transitions. [2021-12-07 00:12:15,331 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8855140186915887 [2021-12-07 00:12:15,331 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 379 transitions. [2021-12-07 00:12:15,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 379 transitions. [2021-12-07 00:12:15,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:12:15,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 379 transitions. [2021-12-07 00:12:15,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 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-07 00:12:15,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 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-07 00:12:15,334 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 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-07 00:12:15,334 INFO L186 Difference]: Start difference. First operand has 104 places, 97 transitions, 269 flow. Second operand 4 states and 379 transitions. [2021-12-07 00:12:15,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 119 transitions, 426 flow [2021-12-07 00:12:15,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 119 transitions, 420 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-07 00:12:15,339 INFO L242 Difference]: Finished difference. Result has 108 places, 102 transitions, 313 flow [2021-12-07 00:12:15,339 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=313, PETRI_PLACES=108, PETRI_TRANSITIONS=102} [2021-12-07 00:12:15,339 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 12 predicate places. [2021-12-07 00:12:15,340 INFO L470 AbstractCegarLoop]: Abstraction has has 108 places, 102 transitions, 313 flow [2021-12-07 00:12:15,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 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-07 00:12:15,340 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:12:15,340 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] [2021-12-07 00:12:15,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-07 00:12:15,341 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-07 00:12:15,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:12:15,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1069972452, now seen corresponding path program 1 times [2021-12-07 00:12:15,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:12:15,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250458463] [2021-12-07 00:12:15,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:12:15,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:12:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:12:15,452 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-07 00:12:15,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:12:15,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250458463] [2021-12-07 00:12:15,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250458463] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:12:15,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:12:15,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 00:12:15,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796276622] [2021-12-07 00:12:15,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:12:15,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 00:12:15,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:12:15,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 00:12:15,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-07 00:12:15,456 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2021-12-07 00:12:15,457 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 102 transitions, 313 flow. Second operand has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 0 states have call successors, (0), 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-07 00:12:15,457 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:12:15,457 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2021-12-07 00:12:15,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:12:15,806 INFO L129 PetriNetUnfolder]: 1128/2972 cut-off events. [2021-12-07 00:12:15,806 INFO L130 PetriNetUnfolder]: For 3069/3307 co-relation queries the response was YES. [2021-12-07 00:12:15,818 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7052 conditions, 2972 events. 1128/2972 cut-off events. For 3069/3307 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 25076 event pairs, 343 based on Foata normal form. 207/3107 useless extension candidates. Maximal degree in co-relation 7040. Up to 836 conditions per place. [2021-12-07 00:12:15,834 INFO L132 encePairwiseOnDemand]: 99/107 looper letters, 52 selfloop transitions, 7 changer transitions 1/136 dead transitions. [2021-12-07 00:12:15,834 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 136 transitions, 571 flow [2021-12-07 00:12:15,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 00:12:15,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-07 00:12:15,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 544 transitions. [2021-12-07 00:12:15,836 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8473520249221184 [2021-12-07 00:12:15,836 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 544 transitions. [2021-12-07 00:12:15,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 544 transitions. [2021-12-07 00:12:15,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:12:15,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 544 transitions. [2021-12-07 00:12:15,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 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-07 00:12:15,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 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-07 00:12:15,840 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 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-07 00:12:15,840 INFO L186 Difference]: Start difference. First operand has 108 places, 102 transitions, 313 flow. Second operand 6 states and 544 transitions. [2021-12-07 00:12:15,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 136 transitions, 571 flow [2021-12-07 00:12:15,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 136 transitions, 571 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-07 00:12:15,845 INFO L242 Difference]: Finished difference. Result has 116 places, 105 transitions, 364 flow [2021-12-07 00:12:15,845 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=364, PETRI_PLACES=116, PETRI_TRANSITIONS=105} [2021-12-07 00:12:15,846 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 20 predicate places. [2021-12-07 00:12:15,846 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 105 transitions, 364 flow [2021-12-07 00:12:15,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 0 states have call successors, (0), 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-07 00:12:15,846 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:12:15,846 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] [2021-12-07 00:12:15,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-07 00:12:15,847 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-07 00:12:15,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:12:15,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1680413944, now seen corresponding path program 3 times [2021-12-07 00:12:15,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:12:15,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429494026] [2021-12-07 00:12:15,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:12:15,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:12:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:12:15,903 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-07 00:12:15,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:12:15,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429494026] [2021-12-07 00:12:15,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429494026] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:12:15,904 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:12:15,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:12:15,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620424199] [2021-12-07 00:12:15,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:12:15,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 00:12:15,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:12:15,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:12:15,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:12:15,906 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2021-12-07 00:12:15,906 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 105 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 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-07 00:12:15,907 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:12:15,907 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2021-12-07 00:12:15,907 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:12:16,259 INFO L129 PetriNetUnfolder]: 1170/3388 cut-off events. [2021-12-07 00:12:16,260 INFO L130 PetriNetUnfolder]: For 5484/5889 co-relation queries the response was YES. [2021-12-07 00:12:16,275 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8923 conditions, 3388 events. 1170/3388 cut-off events. For 5484/5889 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 31163 event pairs, 509 based on Foata normal form. 265/3458 useless extension candidates. Maximal degree in co-relation 8907. Up to 906 conditions per place. [2021-12-07 00:12:16,297 INFO L132 encePairwiseOnDemand]: 101/107 looper letters, 39 selfloop transitions, 10 changer transitions 2/132 dead transitions. [2021-12-07 00:12:16,297 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 132 transitions, 616 flow [2021-12-07 00:12:16,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 00:12:16,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-07 00:12:16,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 379 transitions. [2021-12-07 00:12:16,299 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8855140186915887 [2021-12-07 00:12:16,299 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 379 transitions. [2021-12-07 00:12:16,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 379 transitions. [2021-12-07 00:12:16,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:12:16,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 379 transitions. [2021-12-07 00:12:16,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 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-07 00:12:16,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 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-07 00:12:16,302 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 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-07 00:12:16,302 INFO L186 Difference]: Start difference. First operand has 116 places, 105 transitions, 364 flow. Second operand 4 states and 379 transitions. [2021-12-07 00:12:16,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 132 transitions, 616 flow [2021-12-07 00:12:16,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 132 transitions, 609 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-07 00:12:16,309 INFO L242 Difference]: Finished difference. Result has 119 places, 111 transitions, 459 flow [2021-12-07 00:12:16,309 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=459, PETRI_PLACES=119, PETRI_TRANSITIONS=111} [2021-12-07 00:12:16,310 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 23 predicate places. [2021-12-07 00:12:16,310 INFO L470 AbstractCegarLoop]: Abstraction has has 119 places, 111 transitions, 459 flow [2021-12-07 00:12:16,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 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-07 00:12:16,310 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:12:16,310 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] [2021-12-07 00:12:16,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-07 00:12:16,311 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-07 00:12:16,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:12:16,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1752919980, now seen corresponding path program 1 times [2021-12-07 00:12:16,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:12:16,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187541220] [2021-12-07 00:12:16,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:12:16,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:12:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:12:16,389 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-07 00:12:16,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:12:16,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187541220] [2021-12-07 00:12:16,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187541220] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:12:16,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:12:16,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:12:16,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792964188] [2021-12-07 00:12:16,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:12:16,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 00:12:16,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:12:16,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:12:16,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:12:16,392 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2021-12-07 00:12:16,393 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 459 flow. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 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-07 00:12:16,393 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:12:16,393 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2021-12-07 00:12:16,393 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:12:16,802 INFO L129 PetriNetUnfolder]: 1308/3777 cut-off events. [2021-12-07 00:12:16,802 INFO L130 PetriNetUnfolder]: For 12859/13724 co-relation queries the response was YES. [2021-12-07 00:12:16,826 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11743 conditions, 3777 events. 1308/3777 cut-off events. For 12859/13724 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 35345 event pairs, 674 based on Foata normal form. 232/3695 useless extension candidates. Maximal degree in co-relation 11725. Up to 1487 conditions per place. [2021-12-07 00:12:16,851 INFO L132 encePairwiseOnDemand]: 101/107 looper letters, 37 selfloop transitions, 8 changer transitions 6/133 dead transitions. [2021-12-07 00:12:16,851 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 133 transitions, 707 flow [2021-12-07 00:12:16,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 00:12:16,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-07 00:12:16,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 378 transitions. [2021-12-07 00:12:16,853 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.883177570093458 [2021-12-07 00:12:16,853 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 378 transitions. [2021-12-07 00:12:16,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 378 transitions. [2021-12-07 00:12:16,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:12:16,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 378 transitions. [2021-12-07 00:12:16,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 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-07 00:12:16,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 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-07 00:12:16,856 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 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-07 00:12:16,856 INFO L186 Difference]: Start difference. First operand has 119 places, 111 transitions, 459 flow. Second operand 4 states and 378 transitions. [2021-12-07 00:12:16,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 133 transitions, 707 flow [2021-12-07 00:12:16,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 133 transitions, 703 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-07 00:12:16,863 INFO L242 Difference]: Finished difference. Result has 123 places, 113 transitions, 498 flow [2021-12-07 00:12:16,864 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=498, PETRI_PLACES=123, PETRI_TRANSITIONS=113} [2021-12-07 00:12:16,864 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 27 predicate places. [2021-12-07 00:12:16,865 INFO L470 AbstractCegarLoop]: Abstraction has has 123 places, 113 transitions, 498 flow [2021-12-07 00:12:16,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 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-07 00:12:16,865 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:12:16,865 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] [2021-12-07 00:12:16,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-07 00:12:16,865 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-07 00:12:16,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:12:16,866 INFO L85 PathProgramCache]: Analyzing trace with hash -215684502, now seen corresponding path program 4 times [2021-12-07 00:12:16,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:12:16,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51654055] [2021-12-07 00:12:16,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:12:16,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:12:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:12:16,918 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-07 00:12:16,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:12:16,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51654055] [2021-12-07 00:12:16,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51654055] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:12:16,919 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:12:16,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 00:12:16,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274632383] [2021-12-07 00:12:16,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:12:16,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 00:12:16,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:12:16,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 00:12:16,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-07 00:12:16,920 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2021-12-07 00:12:16,921 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 113 transitions, 498 flow. Second operand has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 0 states have call successors, (0), 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-07 00:12:16,921 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:12:16,921 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2021-12-07 00:12:16,921 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:12:17,461 INFO L129 PetriNetUnfolder]: 2135/5361 cut-off events. [2021-12-07 00:12:17,462 INFO L130 PetriNetUnfolder]: For 14252/14950 co-relation queries the response was YES. [2021-12-07 00:12:17,495 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16436 conditions, 5361 events. 2135/5361 cut-off events. For 14252/14950 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 50291 event pairs, 946 based on Foata normal form. 175/5214 useless extension candidates. Maximal degree in co-relation 16416. Up to 1592 conditions per place. [2021-12-07 00:12:17,520 INFO L132 encePairwiseOnDemand]: 99/107 looper letters, 46 selfloop transitions, 6 changer transitions 16/144 dead transitions. [2021-12-07 00:12:17,520 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 144 transitions, 814 flow [2021-12-07 00:12:17,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 00:12:17,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-07 00:12:17,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 542 transitions. [2021-12-07 00:12:17,522 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8442367601246106 [2021-12-07 00:12:17,522 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 542 transitions. [2021-12-07 00:12:17,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 542 transitions. [2021-12-07 00:12:17,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:12:17,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 542 transitions. [2021-12-07 00:12:17,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 0 states have call successors, (0), 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-07 00:12:17,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 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-07 00:12:17,526 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 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-07 00:12:17,526 INFO L186 Difference]: Start difference. First operand has 123 places, 113 transitions, 498 flow. Second operand 6 states and 542 transitions. [2021-12-07 00:12:17,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 144 transitions, 814 flow [2021-12-07 00:12:17,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 144 transitions, 799 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-12-07 00:12:17,536 INFO L242 Difference]: Finished difference. Result has 130 places, 112 transitions, 499 flow [2021-12-07 00:12:17,537 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=499, PETRI_PLACES=130, PETRI_TRANSITIONS=112} [2021-12-07 00:12:17,537 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 34 predicate places. [2021-12-07 00:12:17,537 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 112 transitions, 499 flow [2021-12-07 00:12:17,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 0 states have call successors, (0), 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-07 00:12:17,538 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:12:17,538 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] [2021-12-07 00:12:17,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-07 00:12:17,538 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-07 00:12:17,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:12:17,539 INFO L85 PathProgramCache]: Analyzing trace with hash 401888418, now seen corresponding path program 2 times [2021-12-07 00:12:17,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:12:17,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252340064] [2021-12-07 00:12:17,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:12:17,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:12:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:12:17,585 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-07 00:12:17,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:12:17,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252340064] [2021-12-07 00:12:17,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252340064] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:12:17,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:12:17,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:12:17,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298124287] [2021-12-07 00:12:17,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:12:17,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 00:12:17,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:12:17,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:12:17,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:12:17,587 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2021-12-07 00:12:17,587 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 112 transitions, 499 flow. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 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-07 00:12:17,587 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:12:17,587 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2021-12-07 00:12:17,587 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:12:17,894 INFO L129 PetriNetUnfolder]: 1236/3192 cut-off events. [2021-12-07 00:12:17,894 INFO L130 PetriNetUnfolder]: For 13531/14630 co-relation queries the response was YES. [2021-12-07 00:12:17,909 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11250 conditions, 3192 events. 1236/3192 cut-off events. For 13531/14630 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 27195 event pairs, 364 based on Foata normal form. 213/3170 useless extension candidates. Maximal degree in co-relation 11227. Up to 916 conditions per place. [2021-12-07 00:12:17,924 INFO L132 encePairwiseOnDemand]: 101/107 looper letters, 40 selfloop transitions, 15 changer transitions 3/139 dead transitions. [2021-12-07 00:12:17,924 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 139 transitions, 858 flow [2021-12-07 00:12:17,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 00:12:17,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-07 00:12:17,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 376 transitions. [2021-12-07 00:12:17,926 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8785046728971962 [2021-12-07 00:12:17,926 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 376 transitions. [2021-12-07 00:12:17,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 376 transitions. [2021-12-07 00:12:17,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:12:17,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 376 transitions. [2021-12-07 00:12:17,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 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-07 00:12:17,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 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-07 00:12:17,929 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 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-07 00:12:17,929 INFO L186 Difference]: Start difference. First operand has 130 places, 112 transitions, 499 flow. Second operand 4 states and 376 transitions. [2021-12-07 00:12:17,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 139 transitions, 858 flow [2021-12-07 00:12:17,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 139 transitions, 794 flow, removed 26 selfloop flow, removed 6 redundant places. [2021-12-07 00:12:17,946 INFO L242 Difference]: Finished difference. Result has 125 places, 119 transitions, 614 flow [2021-12-07 00:12:17,946 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=614, PETRI_PLACES=125, PETRI_TRANSITIONS=119} [2021-12-07 00:12:17,947 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 29 predicate places. [2021-12-07 00:12:17,947 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 119 transitions, 614 flow [2021-12-07 00:12:17,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 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-07 00:12:17,947 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:12:17,947 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] [2021-12-07 00:12:17,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-07 00:12:17,948 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-07 00:12:17,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:12:17,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1597009161, now seen corresponding path program 1 times [2021-12-07 00:12:17,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:12:17,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662322088] [2021-12-07 00:12:17,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:12:17,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:12:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:12:18,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 00:12:18,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:12:18,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662322088] [2021-12-07 00:12:18,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662322088] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:12:18,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280997115] [2021-12-07 00:12:18,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:12:18,020 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:12:18,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:12:18,024 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:12:18,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-07 00:12:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:12:18,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-07 00:12:18,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:12:18,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 00:12:18,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:12:18,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 00:12:18,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280997115] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-07 00:12:18,349 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-07 00:12:18,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 7 [2021-12-07 00:12:18,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25420708] [2021-12-07 00:12:18,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:12:18,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 00:12:18,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:12:18,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:12:18,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-07 00:12:18,351 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2021-12-07 00:12:18,351 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 119 transitions, 614 flow. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 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-07 00:12:18,351 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:12:18,351 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2021-12-07 00:12:18,351 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:12:18,698 INFO L129 PetriNetUnfolder]: 1406/3297 cut-off events. [2021-12-07 00:12:18,698 INFO L130 PetriNetUnfolder]: For 14591/15799 co-relation queries the response was YES. [2021-12-07 00:12:18,716 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12349 conditions, 3297 events. 1406/3297 cut-off events. For 14591/15799 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 26513 event pairs, 234 based on Foata normal form. 241/3351 useless extension candidates. Maximal degree in co-relation 12328. Up to 1090 conditions per place. [2021-12-07 00:12:18,745 INFO L132 encePairwiseOnDemand]: 101/107 looper letters, 39 selfloop transitions, 15 changer transitions 1/138 dead transitions. [2021-12-07 00:12:18,745 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 138 transitions, 893 flow [2021-12-07 00:12:18,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 00:12:18,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-07 00:12:18,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 372 transitions. [2021-12-07 00:12:18,747 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8691588785046729 [2021-12-07 00:12:18,748 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 372 transitions. [2021-12-07 00:12:18,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 372 transitions. [2021-12-07 00:12:18,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:12:18,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 372 transitions. [2021-12-07 00:12:18,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 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-07 00:12:18,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 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-07 00:12:18,751 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 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-07 00:12:18,751 INFO L186 Difference]: Start difference. First operand has 125 places, 119 transitions, 614 flow. Second operand 4 states and 372 transitions. [2021-12-07 00:12:18,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 138 transitions, 893 flow [2021-12-07 00:12:18,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 138 transitions, 873 flow, removed 6 selfloop flow, removed 3 redundant places. [2021-12-07 00:12:18,762 INFO L242 Difference]: Finished difference. Result has 125 places, 123 transitions, 695 flow [2021-12-07 00:12:18,762 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=695, PETRI_PLACES=125, PETRI_TRANSITIONS=123} [2021-12-07 00:12:18,763 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 29 predicate places. [2021-12-07 00:12:18,763 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 123 transitions, 695 flow [2021-12-07 00:12:18,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 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-07 00:12:18,763 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:12:18,763 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] [2021-12-07 00:12:18,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-07 00:12:18,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:12:18,965 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-07 00:12:18,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:12:18,966 INFO L85 PathProgramCache]: Analyzing trace with hash 739778129, now seen corresponding path program 2 times [2021-12-07 00:12:18,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:12:18,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058276678] [2021-12-07 00:12:18,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:12:18,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:12:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:12:19,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 00:12:19,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:12:19,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058276678] [2021-12-07 00:12:19,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058276678] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:12:19,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068632953] [2021-12-07 00:12:19,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-07 00:12:19,090 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:12:19,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:12:19,091 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:12:19,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-07 00:12:19,156 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-07 00:12:19,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 00:12:19,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-07 00:12:19,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:12:19,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 00:12:19,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:12:19,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 00:12:19,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068632953] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:12:19,471 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 00:12:19,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2021-12-07 00:12:19,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088749728] [2021-12-07 00:12:19,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 00:12:19,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 00:12:19,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:12:19,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 00:12:19,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:12:19,473 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2021-12-07 00:12:19,474 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 123 transitions, 695 flow. Second operand has 8 states, 8 states have (on average 86.0) internal successors, (688), 8 states have internal predecessors, (688), 0 states have call successors, (0), 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-07 00:12:19,474 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:12:19,474 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2021-12-07 00:12:19,475 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:12:20,174 INFO L129 PetriNetUnfolder]: 3104/6639 cut-off events. [2021-12-07 00:12:20,174 INFO L130 PetriNetUnfolder]: For 32239/33949 co-relation queries the response was YES. [2021-12-07 00:12:20,204 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26308 conditions, 6639 events. 3104/6639 cut-off events. For 32239/33949 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 57842 event pairs, 303 based on Foata normal form. 328/6635 useless extension candidates. Maximal degree in co-relation 26286. Up to 1814 conditions per place. [2021-12-07 00:12:20,260 INFO L132 encePairwiseOnDemand]: 98/107 looper letters, 106 selfloop transitions, 61 changer transitions 1/245 dead transitions. [2021-12-07 00:12:20,260 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 245 transitions, 2183 flow [2021-12-07 00:12:20,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 00:12:20,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-07 00:12:20,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 918 transitions. [2021-12-07 00:12:20,263 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8579439252336448 [2021-12-07 00:12:20,263 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 918 transitions. [2021-12-07 00:12:20,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 918 transitions. [2021-12-07 00:12:20,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:12:20,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 918 transitions. [2021-12-07 00:12:20,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 91.8) internal successors, (918), 10 states have internal predecessors, (918), 0 states have call successors, (0), 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-07 00:12:20,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 0 states have call successors, (0), 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-07 00:12:20,267 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 0 states have call successors, (0), 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-07 00:12:20,267 INFO L186 Difference]: Start difference. First operand has 125 places, 123 transitions, 695 flow. Second operand 10 states and 918 transitions. [2021-12-07 00:12:20,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 245 transitions, 2183 flow [2021-12-07 00:12:20,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 245 transitions, 2142 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-07 00:12:20,283 INFO L242 Difference]: Finished difference. Result has 140 places, 171 transitions, 1483 flow [2021-12-07 00:12:20,283 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1483, PETRI_PLACES=140, PETRI_TRANSITIONS=171} [2021-12-07 00:12:20,283 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 44 predicate places. [2021-12-07 00:12:20,284 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 171 transitions, 1483 flow [2021-12-07 00:12:20,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.0) internal successors, (688), 8 states have internal predecessors, (688), 0 states have call successors, (0), 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-07 00:12:20,284 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:12:20,284 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] [2021-12-07 00:12:20,304 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-07 00:12:20,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:12:20,486 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-07 00:12:20,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:12:20,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1255263895, now seen corresponding path program 3 times [2021-12-07 00:12:20,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:12:20,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594904548] [2021-12-07 00:12:20,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:12:20,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:12:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:12:20,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 00:12:20,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:12:20,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594904548] [2021-12-07 00:12:20,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594904548] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:12:20,645 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:12:20,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 00:12:20,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539620357] [2021-12-07 00:12:20,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:12:20,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 00:12:20,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:12:20,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 00:12:20,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-07 00:12:20,646 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2021-12-07 00:12:20,647 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 171 transitions, 1483 flow. Second operand has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 0 states have call successors, (0), 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-07 00:12:20,647 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:12:20,647 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2021-12-07 00:12:20,647 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:12:21,163 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([253] L50-5-->L50-6: Formula: (not (< (mod v_thread2Thread1of1ForFork2_~i~1_3 4294967296) (mod v_~c~0_3 4294967296))) InVars {~c~0=v_~c~0_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3} OutVars{~c~0=v_~c~0_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3} AuxVars[] AssignedVars[][73], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), 118#(= ~x_1~0 0), Black: 138#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 69#L58-4true, 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), 14#L50-6true, 62#L43true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1216#true, Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 707#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 706#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 488#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 89#L75-4true, Black: 702#true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:21,163 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-07 00:12:21,163 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-07 00:12:21,163 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-07 00:12:21,163 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-07 00:12:21,164 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][59], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), 118#(= ~x_1~0 0), Black: 138#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 69#L58-4true, 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), 62#L43true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1216#true, Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 707#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 706#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 488#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 89#L75-4true, Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:21,164 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-07 00:12:21,164 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-07 00:12:21,164 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-07 00:12:21,164 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-07 00:12:21,200 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([253] L50-5-->L50-6: Formula: (not (< (mod v_thread2Thread1of1ForFork2_~i~1_3 4294967296) (mod v_~c~0_3 4294967296))) InVars {~c~0=v_~c~0_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3} OutVars{~c~0=v_~c~0_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3} AuxVars[] AssignedVars[][73], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), 118#(= ~x_1~0 0), Black: 138#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), 14#L50-6true, 80#L58-6true, 62#L43true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1216#true, Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 707#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 706#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 488#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 89#L75-4true, Black: 702#true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:21,201 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-07 00:12:21,201 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:21,201 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:21,201 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:21,201 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][59], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), 118#(= ~x_1~0 0), Black: 138#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), 80#L58-6true, 62#L43true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1216#true, Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 707#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 706#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 488#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 89#L75-4true, Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:21,201 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-07 00:12:21,201 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:21,201 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:21,201 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:21,371 INFO L129 PetriNetUnfolder]: 3308/6879 cut-off events. [2021-12-07 00:12:21,372 INFO L130 PetriNetUnfolder]: For 52640/55882 co-relation queries the response was YES. [2021-12-07 00:12:21,405 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31807 conditions, 6879 events. 3308/6879 cut-off events. For 52640/55882 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 58564 event pairs, 843 based on Foata normal form. 360/6816 useless extension candidates. Maximal degree in co-relation 31778. Up to 2236 conditions per place. [2021-12-07 00:12:21,439 INFO L132 encePairwiseOnDemand]: 99/107 looper letters, 97 selfloop transitions, 51 changer transitions 2/227 dead transitions. [2021-12-07 00:12:21,440 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 227 transitions, 2450 flow [2021-12-07 00:12:21,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 00:12:21,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-07 00:12:21,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 550 transitions. [2021-12-07 00:12:21,441 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8566978193146417 [2021-12-07 00:12:21,441 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 550 transitions. [2021-12-07 00:12:21,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 550 transitions. [2021-12-07 00:12:21,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:12:21,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 550 transitions. [2021-12-07 00:12:21,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 0 states have call successors, (0), 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-07 00:12:21,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 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-07 00:12:21,444 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 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-07 00:12:21,444 INFO L186 Difference]: Start difference. First operand has 140 places, 171 transitions, 1483 flow. Second operand 6 states and 550 transitions. [2021-12-07 00:12:21,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 227 transitions, 2450 flow [2021-12-07 00:12:21,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 227 transitions, 2426 flow, removed 12 selfloop flow, removed 0 redundant places. [2021-12-07 00:12:21,484 INFO L242 Difference]: Finished difference. Result has 148 places, 190 transitions, 1950 flow [2021-12-07 00:12:21,484 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=1459, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1950, PETRI_PLACES=148, PETRI_TRANSITIONS=190} [2021-12-07 00:12:21,484 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 52 predicate places. [2021-12-07 00:12:21,485 INFO L470 AbstractCegarLoop]: Abstraction has has 148 places, 190 transitions, 1950 flow [2021-12-07 00:12:21,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 0 states have call successors, (0), 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-07 00:12:21,485 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:12:21,485 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] [2021-12-07 00:12:21,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-07 00:12:21,485 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-07 00:12:21,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:12:21,486 INFO L85 PathProgramCache]: Analyzing trace with hash 856452868, now seen corresponding path program 1 times [2021-12-07 00:12:21,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:12:21,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959720024] [2021-12-07 00:12:21,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:12:21,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:12:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:12:21,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:12:21,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:12:21,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959720024] [2021-12-07 00:12:21,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959720024] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:12:21,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898688631] [2021-12-07 00:12:21,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:12:21,638 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:12:21,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:12:21,639 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:12:21,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-07 00:12:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:12:21,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-07 00:12:21,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:12:22,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:12:22,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:12:22,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:12:22,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898688631] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:12:22,393 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 00:12:22,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 16 [2021-12-07 00:12:22,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840612145] [2021-12-07 00:12:22,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 00:12:22,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-07 00:12:22,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:12:22,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-07 00:12:22,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-12-07 00:12:22,398 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2021-12-07 00:12:22,399 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 190 transitions, 1950 flow. Second operand has 16 states, 16 states have (on average 83.5625) internal successors, (1337), 16 states have internal predecessors, (1337), 0 states have call successors, (0), 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-07 00:12:22,400 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:12:22,400 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2021-12-07 00:12:22,400 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:12:22,925 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][156], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 138#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 145#true, 39#L51true, 7#L42-6true, Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1232#(and (<= (+ ~x_1~0 ~b~0) ~x_3~0) (= ~x_2~0 0) (<= ~x_3~0 (+ ~x_1~0 ~b~0))), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 1216#true, 116#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, Black: 707#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 706#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, 89#L75-4true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:22,925 INFO L384 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2021-12-07 00:12:22,925 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:22,925 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:22,925 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:23,017 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][175], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), 44#L50-2true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 134#(= thread3Thread1of1ForFork0_~i~2 0), 1226#true, 94#L76-2true, Black: 138#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread3Thread1of1ForFork0_~i~2 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 68#L58-2true, Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 116#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 707#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 706#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 702#true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:23,017 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2021-12-07 00:12:23,017 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-07 00:12:23,017 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-07 00:12:23,017 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-07 00:12:23,036 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][156], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 138#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 7#L42-6true, Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 1216#true, 116#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 64#L59true, Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 707#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 706#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:23,036 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-07 00:12:23,036 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:23,036 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:23,036 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:23,051 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][156], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 138#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 7#L42-6true, Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 1216#true, 116#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, Black: 707#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 706#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 702#true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:23,051 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-07 00:12:23,051 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:23,051 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:23,051 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:23,117 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][175], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 44#L50-2true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 134#(= thread3Thread1of1ForFork0_~i~2 0), 1226#true, Black: 138#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread3Thread1of1ForFork0_~i~2 0)), 94#L76-2true, 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 145#true, 68#L58-2true, Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 116#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 707#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 706#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 702#true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:23,117 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2021-12-07 00:12:23,117 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-07 00:12:23,117 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-07 00:12:23,117 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-07 00:12:23,135 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][175], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), 44#L50-2true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 134#(= thread3Thread1of1ForFork0_~i~2 0), 1226#true, Black: 138#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread3Thread1of1ForFork0_~i~2 0)), 94#L76-2true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 68#L58-2true, Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 116#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 707#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 706#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 702#true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:23,135 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is not cut-off event [2021-12-07 00:12:23,136 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2021-12-07 00:12:23,136 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is not cut-off event [2021-12-07 00:12:23,136 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2021-12-07 00:12:23,321 INFO L129 PetriNetUnfolder]: 1905/5784 cut-off events. [2021-12-07 00:12:23,321 INFO L130 PetriNetUnfolder]: For 29678/31177 co-relation queries the response was YES. [2021-12-07 00:12:23,359 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22359 conditions, 5784 events. 1905/5784 cut-off events. For 29678/31177 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 57268 event pairs, 261 based on Foata normal form. 156/5646 useless extension candidates. Maximal degree in co-relation 22326. Up to 1183 conditions per place. [2021-12-07 00:12:23,383 INFO L132 encePairwiseOnDemand]: 94/107 looper letters, 41 selfloop transitions, 31 changer transitions 8/244 dead transitions. [2021-12-07 00:12:23,383 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 244 transitions, 2293 flow [2021-12-07 00:12:23,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-07 00:12:23,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-12-07 00:12:23,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1540 transitions. [2021-12-07 00:12:23,386 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7995846313603323 [2021-12-07 00:12:23,387 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1540 transitions. [2021-12-07 00:12:23,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1540 transitions. [2021-12-07 00:12:23,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:12:23,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1540 transitions. [2021-12-07 00:12:23,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 85.55555555555556) internal successors, (1540), 18 states have internal predecessors, (1540), 0 states have call successors, (0), 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-07 00:12:23,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 107.0) internal successors, (2033), 19 states have internal predecessors, (2033), 0 states have call successors, (0), 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-07 00:12:23,394 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 107.0) internal successors, (2033), 19 states have internal predecessors, (2033), 0 states have call successors, (0), 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-07 00:12:23,394 INFO L186 Difference]: Start difference. First operand has 148 places, 190 transitions, 1950 flow. Second operand 18 states and 1540 transitions. [2021-12-07 00:12:23,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 244 transitions, 2293 flow [2021-12-07 00:12:23,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 244 transitions, 2102 flow, removed 64 selfloop flow, removed 6 redundant places. [2021-12-07 00:12:23,425 INFO L242 Difference]: Finished difference. Result has 164 places, 211 transitions, 1951 flow [2021-12-07 00:12:23,425 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=1759, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1951, PETRI_PLACES=164, PETRI_TRANSITIONS=211} [2021-12-07 00:12:23,426 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 68 predicate places. [2021-12-07 00:12:23,426 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 211 transitions, 1951 flow [2021-12-07 00:12:23,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 83.5625) internal successors, (1337), 16 states have internal predecessors, (1337), 0 states have call successors, (0), 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-07 00:12:23,426 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:12:23,426 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] [2021-12-07 00:12:23,446 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-07 00:12:23,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:12:23,628 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-07 00:12:23,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:12:23,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1297516402, now seen corresponding path program 2 times [2021-12-07 00:12:23,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:12:23,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207295341] [2021-12-07 00:12:23,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:12:23,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:12:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:12:23,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:12:23,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:12:23,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207295341] [2021-12-07 00:12:23,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207295341] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:12:23,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143202113] [2021-12-07 00:12:23,787 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-07 00:12:23,787 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:12:23,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:12:23,788 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:12:23,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-07 00:12:23,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-07 00:12:23,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 00:12:23,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-07 00:12:23,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:12:24,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:12:24,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:12:24,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 00:12:24,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143202113] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:12:24,476 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 00:12:24,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 17 [2021-12-07 00:12:24,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390861549] [2021-12-07 00:12:24,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 00:12:24,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-07 00:12:24,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:12:24,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-07 00:12:24,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-12-07 00:12:24,480 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2021-12-07 00:12:24,482 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 211 transitions, 1951 flow. Second operand has 17 states, 17 states have (on average 83.52941176470588) internal successors, (1420), 17 states have internal predecessors, (1420), 0 states have call successors, (0), 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-07 00:12:24,482 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:12:24,482 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2021-12-07 00:12:24,482 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:12:24,709 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([244] L42-5-->L43: Formula: (< (mod v_thread1Thread1of1ForFork1_~i~0_5 4294967296) (mod v_~c~0_2 4294967296)) InVars {~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} OutVars{~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} AuxVars[] AssignedVars[][48], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, 62#L43true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 702#true, 116#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1771#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1773#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1775#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1777#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 55#L74-4true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:24,709 INFO L384 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2021-12-07 00:12:24,709 INFO L387 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2021-12-07 00:12:24,709 INFO L387 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2021-12-07 00:12:24,709 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-07 00:12:24,947 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][134], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 48#L42-4true, Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), 116#true, 27#L58-5true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1771#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1773#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1775#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1777#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:24,947 INFO L384 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2021-12-07 00:12:24,947 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-07 00:12:24,947 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-07 00:12:24,947 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-07 00:12:24,988 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([261] thread3ENTRY-->L58-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2][83], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 48#L42-4true, Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), 116#true, 27#L58-5true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1771#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1773#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1775#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1777#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 702#true, 89#L75-4true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:24,988 INFO L384 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2021-12-07 00:12:24,988 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-07 00:12:24,989 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-07 00:12:24,989 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-07 00:12:24,989 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([244] L42-5-->L43: Formula: (< (mod v_thread1Thread1of1ForFork1_~i~0_5 4294967296) (mod v_~c~0_2 4294967296)) InVars {~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} OutVars{~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} AuxVars[] AssignedVars[][48], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 145#true, 39#L51true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 75#thread3ENTRYtrue, Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, 62#L43true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 702#true, 116#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1771#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1773#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1775#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1777#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 89#L75-4true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:24,989 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-07 00:12:24,989 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-07 00:12:24,989 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-07 00:12:24,989 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-07 00:12:25,053 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][61], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, 62#L43true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 116#true, Black: 1771#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1773#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1775#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1777#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 702#true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:25,053 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-07 00:12:25,053 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:25,053 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:25,053 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:25,054 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][158], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 145#true, 39#L51true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 7#L42-6true, Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 116#true, Black: 1771#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1773#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1775#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1777#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 64#L59true, Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, 89#L75-4true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:25,054 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-07 00:12:25,054 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:25,054 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:25,054 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:25,054 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([244] L42-5-->L43: Formula: (< (mod v_thread1Thread1of1ForFork1_~i~0_5 4294967296) (mod v_~c~0_2 4294967296)) InVars {~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} OutVars{~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} AuxVars[] AssignedVars[][48], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 145#true, 39#L51true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, 62#L43true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 702#true, 116#true, 27#L58-5true, Black: 1771#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1773#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1775#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1777#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 89#L75-4true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:25,054 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2021-12-07 00:12:25,055 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-12-07 00:12:25,055 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-07 00:12:25,055 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-07 00:12:25,179 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][61], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 7#L42-6true, Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 116#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1771#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1773#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1775#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1777#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 64#L59true, Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, 89#L75-4true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:25,179 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-07 00:12:25,179 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:25,180 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:25,180 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:25,223 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][179], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), 44#L50-2true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 94#L76-2true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 68#L58-2true, Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 116#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1771#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1773#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1775#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1777#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:25,224 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2021-12-07 00:12:25,224 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-07 00:12:25,224 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-07 00:12:25,224 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-12-07 00:12:25,260 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][61], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 68#L58-2true, Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, 62#L43true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 116#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1771#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1773#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1775#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1777#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, 89#L75-4true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:25,260 INFO L384 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2021-12-07 00:12:25,260 INFO L387 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2021-12-07 00:12:25,260 INFO L387 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2021-12-07 00:12:25,260 INFO L387 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2021-12-07 00:12:25,470 INFO L129 PetriNetUnfolder]: 2345/7257 cut-off events. [2021-12-07 00:12:25,470 INFO L130 PetriNetUnfolder]: For 30265/32318 co-relation queries the response was YES. [2021-12-07 00:12:25,552 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27296 conditions, 7257 events. 2345/7257 cut-off events. For 30265/32318 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 74671 event pairs, 309 based on Foata normal form. 286/7227 useless extension candidates. Maximal degree in co-relation 27261. Up to 1502 conditions per place. [2021-12-07 00:12:25,582 INFO L132 encePairwiseOnDemand]: 95/107 looper letters, 59 selfloop transitions, 30 changer transitions 8/261 dead transitions. [2021-12-07 00:12:25,582 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 261 transitions, 2376 flow [2021-12-07 00:12:25,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-07 00:12:25,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-12-07 00:12:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1461 transitions. [2021-12-07 00:12:25,585 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8031885651456845 [2021-12-07 00:12:25,585 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1461 transitions. [2021-12-07 00:12:25,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1461 transitions. [2021-12-07 00:12:25,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:12:25,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1461 transitions. [2021-12-07 00:12:25,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 85.94117647058823) internal successors, (1461), 17 states have internal predecessors, (1461), 0 states have call successors, (0), 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-07 00:12:25,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 107.0) internal successors, (1926), 18 states have internal predecessors, (1926), 0 states have call successors, (0), 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-07 00:12:25,592 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 107.0) internal successors, (1926), 18 states have internal predecessors, (1926), 0 states have call successors, (0), 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-07 00:12:25,592 INFO L186 Difference]: Start difference. First operand has 164 places, 211 transitions, 1951 flow. Second operand 17 states and 1461 transitions. [2021-12-07 00:12:25,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 261 transitions, 2376 flow [2021-12-07 00:12:25,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 261 transitions, 2207 flow, removed 68 selfloop flow, removed 13 redundant places. [2021-12-07 00:12:25,640 INFO L242 Difference]: Finished difference. Result has 169 places, 226 transitions, 1992 flow [2021-12-07 00:12:25,640 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=1846, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1992, PETRI_PLACES=169, PETRI_TRANSITIONS=226} [2021-12-07 00:12:25,641 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 73 predicate places. [2021-12-07 00:12:25,641 INFO L470 AbstractCegarLoop]: Abstraction has has 169 places, 226 transitions, 1992 flow [2021-12-07 00:12:25,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 83.52941176470588) internal successors, (1420), 17 states have internal predecessors, (1420), 0 states have call successors, (0), 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-07 00:12:25,641 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:12:25,641 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] [2021-12-07 00:12:25,660 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-07 00:12:25,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-07 00:12:25,843 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-07 00:12:25,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:12:25,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1516377056, now seen corresponding path program 3 times [2021-12-07 00:12:25,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:12:25,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789310065] [2021-12-07 00:12:25,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:12:25,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:12:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:12:25,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:12:25,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:12:25,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789310065] [2021-12-07 00:12:25,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789310065] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:12:25,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795026077] [2021-12-07 00:12:25,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-07 00:12:25,994 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:12:25,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:12:25,995 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:12:25,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-07 00:12:26,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-07 00:12:26,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 00:12:26,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-07 00:12:26,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:12:26,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:12:26,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:12:26,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-07 00:12:26,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795026077] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:12:26,524 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 00:12:26,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 15 [2021-12-07 00:12:26,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714674120] [2021-12-07 00:12:26,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 00:12:26,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-07 00:12:26,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:12:26,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-07 00:12:26,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-12-07 00:12:26,526 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2021-12-07 00:12:26,527 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 226 transitions, 1992 flow. Second operand has 15 states, 15 states have (on average 83.53333333333333) internal successors, (1253), 15 states have internal predecessors, (1253), 0 states have call successors, (0), 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-07 00:12:26,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:12:26,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2021-12-07 00:12:26,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:12:26,715 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([244] L42-5-->L43: Formula: (< (mod v_thread1Thread1of1ForFork1_~i~0_5 4294967296) (mod v_~c~0_2 4294967296)) InVars {~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} OutVars{~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} AuxVars[] AssignedVars[][48], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 145#true, 39#L51true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2335#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2329#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2331#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 2333#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1785#true, 62#L43true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 702#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2343#true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), 55#L74-4true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:26,715 INFO L384 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2021-12-07 00:12:26,715 INFO L387 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2021-12-07 00:12:26,715 INFO L387 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2021-12-07 00:12:26,715 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-07 00:12:27,010 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][131], [113#true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 48#L42-4true, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2335#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2329#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2331#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2333#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), 27#L58-5true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 2343#true, Black: 702#true, 89#L75-4true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:27,010 INFO L384 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2021-12-07 00:12:27,010 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-07 00:12:27,010 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-07 00:12:27,010 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-07 00:12:27,051 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][76], [113#true, 1787#(= ~x_1~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 69#L58-4true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 61#L42-5true, 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2335#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2329#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2331#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2333#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1228#(= ~x_1~0 0), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2345#(= ~x_1~0 0), 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 89#L75-4true, Black: 702#true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:27,051 INFO L384 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2021-12-07 00:12:27,051 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-07 00:12:27,051 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-07 00:12:27,051 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-07 00:12:27,071 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([261] thread3ENTRY-->L58-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2][80], [113#true, 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 48#L42-4true, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2335#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2329#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2331#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2333#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), 27#L58-5true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2343#true, Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:27,071 INFO L384 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2021-12-07 00:12:27,072 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-07 00:12:27,072 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-07 00:12:27,072 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-07 00:12:27,072 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([244] L42-5-->L43: Formula: (< (mod v_thread1Thread1of1ForFork1_~i~0_5 4294967296) (mod v_~c~0_2 4294967296)) InVars {~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} OutVars{~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} AuxVars[] AssignedVars[][48], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 75#thread3ENTRYtrue, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2335#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2329#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2331#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2333#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, 62#L43true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 702#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2343#true, 89#L75-4true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:27,072 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-07 00:12:27,072 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-07 00:12:27,072 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-07 00:12:27,072 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-07 00:12:27,122 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, 1787#(= ~x_1~0 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 69#L58-4true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2335#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2329#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2331#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2333#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 62#L43true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1228#(= ~x_1~0 0), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2345#(= ~x_1~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 89#L75-4true, Black: 702#true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:27,122 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-07 00:12:27,122 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-07 00:12:27,122 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-07 00:12:27,122 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-07 00:12:27,168 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2335#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2329#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2331#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 2333#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1785#true, 62#L43true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 2343#true, Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:27,168 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-07 00:12:27,168 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:27,168 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:27,168 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:27,170 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][157], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 145#true, 39#L51true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 7#L42-6true, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2335#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2329#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2331#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2333#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 2343#true, Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, 89#L75-4true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:27,170 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-07 00:12:27,170 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:27,170 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:27,170 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:27,170 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([244] L42-5-->L43: Formula: (< (mod v_thread1Thread1of1ForFork1_~i~0_5 4294967296) (mod v_~c~0_2 4294967296)) InVars {~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} OutVars{~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} AuxVars[] AssignedVars[][48], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 145#true, 39#L51true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2335#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2329#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2331#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 2333#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1785#true, 62#L43true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 702#true, 27#L58-5true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 2343#true, Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 89#L75-4true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:27,170 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2021-12-07 00:12:27,170 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-12-07 00:12:27,170 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-07 00:12:27,170 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-07 00:12:27,177 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, 1787#(= ~x_1~0 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 1205#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 61#L42-5true, 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2335#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2329#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2331#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2333#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1228#(= ~x_1~0 0), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2345#(= ~x_1~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:27,177 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2021-12-07 00:12:27,177 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-12-07 00:12:27,177 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-07 00:12:27,177 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-07 00:12:27,225 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, 1787#(= ~x_1~0 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 1205#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2335#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2329#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2331#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2333#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 62#L43true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1228#(= ~x_1~0 0), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2345#(= ~x_1~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, 89#L75-4true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:27,225 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-07 00:12:27,226 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:27,226 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:27,226 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:27,227 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, 1787#(= ~x_1~0 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 1205#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2335#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2329#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2331#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2333#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 62#L43true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1228#(= ~x_1~0 0), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2345#(= ~x_1~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:27,227 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-07 00:12:27,227 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:27,227 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:27,227 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:27,227 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:27,334 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 7#L42-6true, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2335#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2329#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2331#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 2333#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1785#true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 2343#true, Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 702#true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:27,334 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-07 00:12:27,334 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:27,334 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:27,334 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:27,438 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][179], [113#true, 44#L50-2true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 94#L76-2true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 68#L58-2true, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2335#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2329#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2331#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2333#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2343#true, Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:27,438 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is not cut-off event [2021-12-07 00:12:27,439 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2021-12-07 00:12:27,439 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is not cut-off event [2021-12-07 00:12:27,439 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2021-12-07 00:12:27,749 INFO L129 PetriNetUnfolder]: 2735/8407 cut-off events. [2021-12-07 00:12:27,749 INFO L130 PetriNetUnfolder]: For 33165/35977 co-relation queries the response was YES. [2021-12-07 00:12:27,823 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30832 conditions, 8407 events. 2735/8407 cut-off events. For 33165/35977 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 88180 event pairs, 433 based on Foata normal form. 229/8231 useless extension candidates. Maximal degree in co-relation 30797. Up to 1907 conditions per place. [2021-12-07 00:12:27,868 INFO L132 encePairwiseOnDemand]: 94/107 looper letters, 71 selfloop transitions, 31 changer transitions 8/274 dead transitions. [2021-12-07 00:12:27,868 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 274 transitions, 2444 flow [2021-12-07 00:12:27,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-07 00:12:27,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-12-07 00:12:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1537 transitions. [2021-12-07 00:12:27,871 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7980269989615784 [2021-12-07 00:12:27,871 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1537 transitions. [2021-12-07 00:12:27,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1537 transitions. [2021-12-07 00:12:27,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:12:27,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1537 transitions. [2021-12-07 00:12:27,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 85.38888888888889) internal successors, (1537), 18 states have internal predecessors, (1537), 0 states have call successors, (0), 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-07 00:12:27,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 107.0) internal successors, (2033), 19 states have internal predecessors, (2033), 0 states have call successors, (0), 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-07 00:12:27,878 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 107.0) internal successors, (2033), 19 states have internal predecessors, (2033), 0 states have call successors, (0), 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-07 00:12:27,878 INFO L186 Difference]: Start difference. First operand has 169 places, 226 transitions, 1992 flow. Second operand 18 states and 1537 transitions. [2021-12-07 00:12:27,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 274 transitions, 2444 flow [2021-12-07 00:12:27,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 274 transitions, 2356 flow, removed 31 selfloop flow, removed 10 redundant places. [2021-12-07 00:12:27,922 INFO L242 Difference]: Finished difference. Result has 178 places, 244 transitions, 2120 flow [2021-12-07 00:12:27,923 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2120, PETRI_PLACES=178, PETRI_TRANSITIONS=244} [2021-12-07 00:12:27,923 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 82 predicate places. [2021-12-07 00:12:27,923 INFO L470 AbstractCegarLoop]: Abstraction has has 178 places, 244 transitions, 2120 flow [2021-12-07 00:12:27,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 83.53333333333333) internal successors, (1253), 15 states have internal predecessors, (1253), 0 states have call successors, (0), 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-07 00:12:27,924 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:12:27,924 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] [2021-12-07 00:12:27,943 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-07 00:12:28,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-07 00:12:28,126 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-07 00:12:28,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:12:28,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1793211408, now seen corresponding path program 4 times [2021-12-07 00:12:28,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:12:28,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091184115] [2021-12-07 00:12:28,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:12:28,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:12:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:12:28,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:12:28,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:12:28,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091184115] [2021-12-07 00:12:28,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091184115] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:12:28,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438910901] [2021-12-07 00:12:28,289 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-07 00:12:28,290 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:12:28,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:12:28,290 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:12:28,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-07 00:12:28,385 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-07 00:12:28,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 00:12:28,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-07 00:12:28,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:12:28,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:12:28,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:12:28,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-07 00:12:28,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438910901] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:12:28,836 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 00:12:28,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 16 [2021-12-07 00:12:28,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988272432] [2021-12-07 00:12:28,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 00:12:28,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-07 00:12:28,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:12:28,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-07 00:12:28,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-12-07 00:12:28,839 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2021-12-07 00:12:28,840 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 244 transitions, 2120 flow. Second operand has 16 states, 16 states have (on average 83.4375) internal successors, (1335), 16 states have internal predecessors, (1335), 0 states have call successors, (0), 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-07 00:12:28,840 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:12:28,840 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2021-12-07 00:12:28,840 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:12:29,319 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][77], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 2887#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 69#L58-4true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2891#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 61#L42-5true, 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1228#(= ~x_1~0 0), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2345#(= ~x_1~0 0), 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 2903#(= ~x_1~0 0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 702#true, 89#L75-4true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:29,319 INFO L384 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2021-12-07 00:12:29,319 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-07 00:12:29,319 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-07 00:12:29,319 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-07 00:12:29,378 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 2887#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 69#L58-4true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2891#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), 62#L43true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1228#(= ~x_1~0 0), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2345#(= ~x_1~0 0), 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 2903#(= ~x_1~0 0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 702#true, 89#L75-4true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:29,378 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-07 00:12:29,378 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-07 00:12:29,378 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-07 00:12:29,378 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-07 00:12:29,432 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 2887#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1205#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2891#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 61#L42-5true, 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1228#(= ~x_1~0 0), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2345#(= ~x_1~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 2903#(= ~x_1~0 0), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 89#L75-4true, Black: 702#true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:29,432 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2021-12-07 00:12:29,432 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-12-07 00:12:29,432 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-07 00:12:29,432 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-07 00:12:29,480 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2887#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1205#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2891#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2889#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2893#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), 62#L43true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1228#(= ~x_1~0 0), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2345#(= ~x_1~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 2903#(= ~x_1~0 0), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, 89#L75-4true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:29,480 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-07 00:12:29,480 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:29,480 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:29,480 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:29,482 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 2887#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1205#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2891#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), 62#L43true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1228#(= ~x_1~0 0), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2345#(= ~x_1~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 2903#(= ~x_1~0 0), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 89#L75-4true, Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:29,482 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-07 00:12:29,482 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:29,482 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:29,482 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:29,482 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:29,525 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][182], [113#true, 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 44#L50-2true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 94#L76-2true, Black: 2887#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2891#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 68#L58-2true, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 2901#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 2343#true, Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 702#true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:29,525 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-07 00:12:29,525 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-07 00:12:29,525 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-07 00:12:29,526 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-07 00:12:29,534 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][157], [113#true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 2887#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2891#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 48#L42-4true, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2901#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 2343#true, 89#L75-4true, Black: 702#true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:29,534 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2021-12-07 00:12:29,534 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-07 00:12:29,534 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-07 00:12:29,534 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-07 00:12:29,578 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][157], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 2887#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2891#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 145#true, 39#L51true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 7#L42-6true, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2901#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 64#L59true, Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 2343#true, Black: 702#true, 89#L75-4true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:29,578 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-12-07 00:12:29,579 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:29,579 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:29,579 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:29,583 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][157], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2887#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2891#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 7#L42-6true, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2901#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 64#L59true, Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 2343#true, Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:29,583 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-07 00:12:29,583 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:29,583 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:29,583 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:29,583 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:29,608 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][157], [113#true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 2887#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2891#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 7#L42-6true, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2901#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 2343#true, Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, 89#L75-4true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:29,608 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-12-07 00:12:29,608 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:29,608 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:29,608 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:29,608 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:29,608 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:29,659 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][182], [113#true, 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 44#L50-2true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 94#L76-2true, Black: 2887#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2891#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2893#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 145#true, 68#L58-2true, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 2901#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2343#true, Black: 702#true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:29,659 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2021-12-07 00:12:29,659 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-07 00:12:29,659 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-07 00:12:29,659 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-07 00:12:29,664 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][182], [113#true, 44#L50-2true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 94#L76-2true, Black: 2887#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2891#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 2901#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 2343#true, Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:29,664 INFO L384 tUnfolder$Statistics]: this new event has 66 ancestors and is not cut-off event [2021-12-07 00:12:29,664 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-12-07 00:12:29,664 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-12-07 00:12:29,664 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2021-12-07 00:12:29,664 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][182], [113#true, 44#L50-2true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 94#L76-2true, Black: 2887#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2891#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 68#L58-2true, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 2901#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 2343#true, Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:29,664 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2021-12-07 00:12:29,664 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-07 00:12:29,664 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-07 00:12:29,664 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-12-07 00:12:29,672 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][120], [113#true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 2887#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 1205#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2891#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 96#L42-2true, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), 1785#true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 2901#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 2343#true, 89#L75-4true, Black: 702#true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:29,672 INFO L384 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2021-12-07 00:12:29,672 INFO L387 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2021-12-07 00:12:29,672 INFO L387 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2021-12-07 00:12:29,672 INFO L387 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2021-12-07 00:12:29,746 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][157], [113#true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 2887#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2891#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 7#L42-6true, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2901#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 2343#true, Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 702#true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:29,746 INFO L384 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2021-12-07 00:12:29,747 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:29,747 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:29,747 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:29,747 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:29,747 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:29,747 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:29,859 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][157], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2887#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2891#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 145#true, 39#L51true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 7#L42-6true, 3289#(<= (div (+ (* ~x_3~0 (- 1)) ~x_2~0 ~x_1~0 (* ~b~0 (- 1)) (- 4294967296)) (- 4294967296)) (+ (div (+ ~x_3~0 (* ~x_1~0 (- 1)) ~b~0 (* ~x_2~0 (- 1))) 4294967296) 1)), Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 64#L59true, Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 2343#true, Black: 702#true, 89#L75-4true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:29,859 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-12-07 00:12:29,859 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:29,859 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:29,860 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:29,876 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][157], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2887#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2891#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 145#true, 39#L51true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 7#L42-6true, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2901#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2730#(<= (div (+ (* ~x_3~0 (- 1)) ~x_2~0 ~x_1~0 (* ~b~0 (- 1)) (- 4294967296)) (- 4294967296)) (+ (div (+ ~x_3~0 (* ~x_1~0 (- 1)) ~b~0 (* ~x_2~0 (- 1))) 4294967296) 1)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, 89#L75-4true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:29,876 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-12-07 00:12:29,876 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:29,876 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-12-07 00:12:29,876 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:29,892 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][157], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 2887#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2891#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 145#true, 39#L51true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 7#L42-6true, 3289#(<= (div (+ (* ~x_3~0 (- 1)) ~x_2~0 ~x_1~0 (* ~b~0 (- 1)) (- 4294967296)) (- 4294967296)) (+ (div (+ ~x_3~0 (* ~x_1~0 (- 1)) ~b~0 (* ~x_2~0 (- 1))) 4294967296) 1)), Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 64#L59true, Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 2343#true, Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, 89#L75-4true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:29,892 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-12-07 00:12:29,892 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-12-07 00:12:29,892 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:29,892 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:29,892 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:30,038 INFO L129 PetriNetUnfolder]: 2999/9440 cut-off events. [2021-12-07 00:12:30,038 INFO L130 PetriNetUnfolder]: For 38635/42792 co-relation queries the response was YES. [2021-12-07 00:12:30,113 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35280 conditions, 9440 events. 2999/9440 cut-off events. For 38635/42792 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 101926 event pairs, 517 based on Foata normal form. 316/9284 useless extension candidates. Maximal degree in co-relation 35242. Up to 2093 conditions per place. [2021-12-07 00:12:30,155 INFO L132 encePairwiseOnDemand]: 96/107 looper letters, 90 selfloop transitions, 30 changer transitions 8/292 dead transitions. [2021-12-07 00:12:30,155 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 292 transitions, 2653 flow [2021-12-07 00:12:30,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-07 00:12:30,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-07 00:12:30,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1378 transitions. [2021-12-07 00:12:30,156 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8049065420560748 [2021-12-07 00:12:30,156 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1378 transitions. [2021-12-07 00:12:30,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1378 transitions. [2021-12-07 00:12:30,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:12:30,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1378 transitions. [2021-12-07 00:12:30,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 86.125) internal successors, (1378), 16 states have internal predecessors, (1378), 0 states have call successors, (0), 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-07 00:12:30,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 107.0) internal successors, (1819), 17 states have internal predecessors, (1819), 0 states have call successors, (0), 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-07 00:12:30,162 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 107.0) internal successors, (1819), 17 states have internal predecessors, (1819), 0 states have call successors, (0), 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-07 00:12:30,162 INFO L186 Difference]: Start difference. First operand has 178 places, 244 transitions, 2120 flow. Second operand 16 states and 1378 transitions. [2021-12-07 00:12:30,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 292 transitions, 2653 flow [2021-12-07 00:12:30,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 292 transitions, 2537 flow, removed 46 selfloop flow, removed 10 redundant places. [2021-12-07 00:12:30,243 INFO L242 Difference]: Finished difference. Result has 185 places, 259 transitions, 2234 flow [2021-12-07 00:12:30,244 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=2028, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2234, PETRI_PLACES=185, PETRI_TRANSITIONS=259} [2021-12-07 00:12:30,244 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 89 predicate places. [2021-12-07 00:12:30,244 INFO L470 AbstractCegarLoop]: Abstraction has has 185 places, 259 transitions, 2234 flow [2021-12-07 00:12:30,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 83.4375) internal successors, (1335), 16 states have internal predecessors, (1335), 0 states have call successors, (0), 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-07 00:12:30,245 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:12:30,245 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] [2021-12-07 00:12:30,264 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-07 00:12:30,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-07 00:12:30,447 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-07 00:12:30,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:12:30,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1064763944, now seen corresponding path program 5 times [2021-12-07 00:12:30,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:12:30,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421823205] [2021-12-07 00:12:30,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:12:30,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:12:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:12:30,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:12:30,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:12:30,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421823205] [2021-12-07 00:12:30,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421823205] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:12:30,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221001602] [2021-12-07 00:12:30,605 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-07 00:12:30,605 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:12:30,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:12:30,606 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:12:30,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-07 00:12:30,678 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-12-07 00:12:30,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 00:12:30,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-07 00:12:30,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:12:30,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:12:30,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:12:31,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:12:31,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221001602] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:12:31,130 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 00:12:31,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 16 [2021-12-07 00:12:31,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778660161] [2021-12-07 00:12:31,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 00:12:31,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-07 00:12:31,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:12:31,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-07 00:12:31,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-12-07 00:12:31,133 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2021-12-07 00:12:31,134 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 259 transitions, 2234 flow. Second operand has 16 states, 16 states have (on average 83.5625) internal successors, (1337), 16 states have internal predecessors, (1337), 0 states have call successors, (0), 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-07 00:12:31,134 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:12:31,134 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2021-12-07 00:12:31,134 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:12:31,653 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][76], [113#true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 3458#(= ~x_1~0 0), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 69#L58-4true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 61#L42-5true, 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2345#(= ~x_1~0 0), 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 2903#(= ~x_1~0 0), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 3446#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3448#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3444#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3442#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 89#L75-4true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 702#true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 3068#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:31,653 INFO L384 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2021-12-07 00:12:31,653 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-07 00:12:31,653 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-07 00:12:31,653 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-07 00:12:31,723 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 3458#(= ~x_1~0 0), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 69#L58-4true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), 62#L43true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2345#(= ~x_1~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 704#(= thread1Thread1of1ForFork1_~i~0 0), 2903#(= ~x_1~0 0), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 3446#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3448#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3444#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3442#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 89#L75-4true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 702#true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 3068#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:31,723 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-07 00:12:31,723 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-07 00:12:31,723 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-07 00:12:31,723 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-07 00:12:31,790 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 3458#(= ~x_1~0 0), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 1205#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 61#L42-5true, 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2345#(= ~x_1~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 2903#(= ~x_1~0 0), Black: 3446#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, Black: 3448#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3444#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 3442#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 702#true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 3068#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:31,790 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2021-12-07 00:12:31,790 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-07 00:12:31,791 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-12-07 00:12:31,791 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-07 00:12:31,850 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 3458#(= ~x_1~0 0), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 1205#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), 62#L43true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2345#(= ~x_1~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 2903#(= ~x_1~0 0), Black: 3446#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, Black: 3448#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3444#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 3442#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 702#true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 3068#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:31,850 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-07 00:12:31,851 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:31,851 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:31,851 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:31,852 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 3458#(= ~x_1~0 0), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 1205#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), 62#L43true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2345#(= ~x_1~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 2903#(= ~x_1~0 0), Black: 3446#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, Black: 3448#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3444#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 3442#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 702#true, Black: 3068#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:31,852 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-07 00:12:31,852 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:31,852 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:31,852 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:31,852 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-07 00:12:32,028 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][158], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 145#true, 39#L51true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 3456#true, 48#L42-4true, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2901#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 64#L59true, Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3446#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3448#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3444#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 3442#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 2343#true, Black: 702#true, 89#L75-4true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 3068#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)))]) [2021-12-07 00:12:32,028 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2021-12-07 00:12:32,029 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-07 00:12:32,029 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-07 00:12:32,029 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-07 00:12:32,029 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][158], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 145#true, 39#L51true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 7#L42-6true, 3456#true, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2901#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 64#L59true, Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3446#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3448#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3444#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 3442#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 2343#true, Black: 702#true, 89#L75-4true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 3068#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)))]) [2021-12-07 00:12:32,029 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-12-07 00:12:32,029 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:32,029 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:32,029 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:32,088 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][158], [113#true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 7#L42-6true, 3456#true, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2901#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, Black: 3446#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3448#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3444#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 3442#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 2343#true, 89#L75-4true, Black: 702#true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 3068#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)))]) [2021-12-07 00:12:32,088 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-12-07 00:12:32,089 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:32,089 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-07 00:12:32,089 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:32,089 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:32,104 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][153], [113#true, 44#L50-2true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 94#L76-2true, Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 3456#true, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 2901#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3446#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 64#L59true, Black: 3448#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 3444#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 2343#true, Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 3442#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 3068#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:32,104 INFO L384 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2021-12-07 00:12:32,104 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2021-12-07 00:12:32,104 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-12-07 00:12:32,104 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-12-07 00:12:32,107 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][153], [113#true, 44#L50-2true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 94#L76-2true, Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 3456#true, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 2901#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 64#L59true, Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3446#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3448#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 3444#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 2343#true, Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 3442#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 702#true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 3068#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)))]) [2021-12-07 00:12:32,107 INFO L384 tUnfolder$Statistics]: this new event has 66 ancestors and is not cut-off event [2021-12-07 00:12:32,107 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2021-12-07 00:12:32,108 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-12-07 00:12:32,108 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-12-07 00:12:32,108 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2021-12-07 00:12:32,108 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][153], [113#true, 44#L50-2true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 94#L76-2true, Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 3456#true, 68#L58-2true, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 2901#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3446#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3448#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 3444#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 3442#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 2343#true, Black: 702#true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 3068#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)))]) [2021-12-07 00:12:32,108 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2021-12-07 00:12:32,108 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-07 00:12:32,108 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-07 00:12:32,108 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-12-07 00:12:32,562 INFO L129 PetriNetUnfolder]: 3430/10662 cut-off events. [2021-12-07 00:12:32,562 INFO L130 PetriNetUnfolder]: For 46683/50253 co-relation queries the response was YES. [2021-12-07 00:12:32,643 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41075 conditions, 10662 events. 3430/10662 cut-off events. For 46683/50253 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 117246 event pairs, 636 based on Foata normal form. 241/10391 useless extension candidates. Maximal degree in co-relation 41034. Up to 2455 conditions per place. [2021-12-07 00:12:32,689 INFO L132 encePairwiseOnDemand]: 96/107 looper letters, 104 selfloop transitions, 31 changer transitions 8/307 dead transitions. [2021-12-07 00:12:32,689 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 307 transitions, 2852 flow [2021-12-07 00:12:32,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-07 00:12:32,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-07 00:12:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1375 transitions. [2021-12-07 00:12:32,691 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8031542056074766 [2021-12-07 00:12:32,691 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1375 transitions. [2021-12-07 00:12:32,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1375 transitions. [2021-12-07 00:12:32,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:12:32,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1375 transitions. [2021-12-07 00:12:32,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 85.9375) internal successors, (1375), 16 states have internal predecessors, (1375), 0 states have call successors, (0), 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-07 00:12:32,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 107.0) internal successors, (1819), 17 states have internal predecessors, (1819), 0 states have call successors, (0), 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-07 00:12:32,696 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 107.0) internal successors, (1819), 17 states have internal predecessors, (1819), 0 states have call successors, (0), 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-07 00:12:32,697 INFO L186 Difference]: Start difference. First operand has 185 places, 259 transitions, 2234 flow. Second operand 16 states and 1375 transitions. [2021-12-07 00:12:32,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 307 transitions, 2852 flow [2021-12-07 00:12:32,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 307 transitions, 2703 flow, removed 61 selfloop flow, removed 9 redundant places. [2021-12-07 00:12:32,749 INFO L242 Difference]: Finished difference. Result has 194 places, 277 transitions, 2371 flow [2021-12-07 00:12:32,750 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=2112, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2371, PETRI_PLACES=194, PETRI_TRANSITIONS=277} [2021-12-07 00:12:32,750 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 98 predicate places. [2021-12-07 00:12:32,750 INFO L470 AbstractCegarLoop]: Abstraction has has 194 places, 277 transitions, 2371 flow [2021-12-07 00:12:32,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 83.5625) internal successors, (1337), 16 states have internal predecessors, (1337), 0 states have call successors, (0), 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-07 00:12:32,751 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:12:32,752 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] [2021-12-07 00:12:32,770 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-07 00:12:32,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-07 00:12:32,953 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-07 00:12:32,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:12:32,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1194472620, now seen corresponding path program 6 times [2021-12-07 00:12:32,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:12:32,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838416533] [2021-12-07 00:12:32,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:12:32,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:12:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:12:33,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:12:33,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:12:33,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838416533] [2021-12-07 00:12:33,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838416533] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:12:33,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520256499] [2021-12-07 00:12:33,067 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-07 00:12:33,067 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:12:33,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:12:33,068 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:12:33,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-07 00:12:33,151 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-12-07 00:12:33,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 00:12:33,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-07 00:12:33,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:12:33,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:12:33,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:12:33,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 00:12:33,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520256499] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:12:33,586 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 00:12:33,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 16 [2021-12-07 00:12:33,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668008442] [2021-12-07 00:12:33,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 00:12:33,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-07 00:12:33,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:12:33,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-07 00:12:33,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-07 00:12:33,588 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2021-12-07 00:12:33,589 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 277 transitions, 2371 flow. Second operand has 16 states, 16 states have (on average 83.625) internal successors, (1338), 16 states have internal predecessors, (1338), 0 states have call successors, (0), 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-07 00:12:33,589 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:12:33,589 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2021-12-07 00:12:33,589 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:12:34,384 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), 3458#(= ~x_1~0 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 69#L58-4true, Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 3461#(and (= ~x_2~0 0) (<= (+ ~b~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~b~0 ~a~0))), Black: 3997#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3746#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 3670#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 3999#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 62#L43true, Black: 4003#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4001#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2345#(= ~x_1~0 0), 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 4014#(= ~x_1~0 0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 89#L75-4true, Black: 702#true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 3068#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:34,384 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-07 00:12:34,384 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-07 00:12:34,384 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-07 00:12:34,384 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-07 00:12:34,516 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][158], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 4012#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 145#true, 39#L51true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 7#L42-6true, 3456#true, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 3461#(and (= ~x_2~0 0) (<= (+ ~b~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~b~0 ~a~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 3997#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 3746#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 3670#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 3999#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4003#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4001#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2901#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 2343#true, Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 702#true, Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 3068#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-07 00:12:34,516 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-12-07 00:12:34,516 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:34,516 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:34,516 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:34,543 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][158], [113#true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 4012#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 7#L42-6true, 3456#true, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 3461#(and (= ~x_2~0 0) (<= (+ ~b~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~b~0 ~a~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3997#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3746#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 1785#true, Black: 3670#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 3999#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4003#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4001#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2901#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 2343#true, Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 89#L75-4true, Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 3068#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:34,543 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-12-07 00:12:34,543 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:34,543 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:34,543 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:34,543 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:34,564 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][153], [113#true, 44#L50-2true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 94#L76-2true, Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 4012#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 3456#true, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 3461#(and (= ~x_2~0 0) (<= (+ ~b~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~b~0 ~a~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3997#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3746#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 1785#true, Black: 3670#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 3999#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4003#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4001#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 2901#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 2343#true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 3068#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:34,564 INFO L384 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2021-12-07 00:12:34,564 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-12-07 00:12:34,564 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-12-07 00:12:34,564 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2021-12-07 00:12:34,568 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][153], [113#true, 44#L50-2true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 94#L76-2true, Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 4012#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 3456#true, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 3461#(and (= ~x_2~0 0) (<= (+ ~b~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~b~0 ~a~0))), Black: 3997#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3746#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 1785#true, Black: 3670#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 3999#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4003#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4001#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 2901#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 2343#true, Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 702#true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 3068#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)))]) [2021-12-07 00:12:34,568 INFO L384 tUnfolder$Statistics]: this new event has 66 ancestors and is not cut-off event [2021-12-07 00:12:34,568 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2021-12-07 00:12:34,568 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-12-07 00:12:34,568 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-12-07 00:12:34,568 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2021-12-07 00:12:34,568 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][153], [113#true, 44#L50-2true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 94#L76-2true, Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 4012#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 145#true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 3456#true, 68#L58-2true, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 3461#(and (= ~x_2~0 0) (<= (+ ~b~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~b~0 ~a~0))), Black: 3997#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3746#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 1785#true, Black: 3670#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 3999#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4003#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4001#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 2901#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2343#true, Black: 702#true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0), Black: 3068#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)))]) [2021-12-07 00:12:34,568 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2021-12-07 00:12:34,568 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-07 00:12:34,568 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-07 00:12:34,568 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-12-07 00:12:34,614 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][158], [113#true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296)) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2350#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2515#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 4012#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 145#true, 39#L51true, Black: 148#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 7#L42-6true, 3456#true, Black: 2076#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1958#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 3461#(and (= ~x_2~0 0) (<= (+ ~b~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~b~0 ~a~0))), Black: 159#(and (<= 0 (div (+ (* (div ~c~0 4294967296) 4294967296) (* ~c~0 (- 1))) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3997#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3746#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 1785#true, Black: 3670#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 3999#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4003#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4001#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 170#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2901#true, Black: 177#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 2343#true, 89#L75-4true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 3068#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1069#(<= (div (+ (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1)) (mod thread1Thread1of1ForFork1_~i~0 4294967296)) (- 4294967296)) 0)]) [2021-12-07 00:12:34,614 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-12-07 00:12:34,614 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:34,614 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:34,614 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:34,614 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:34,615 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-07 00:12:35,226 INFO L129 PetriNetUnfolder]: 3688/11480 cut-off events. [2021-12-07 00:12:35,226 INFO L130 PetriNetUnfolder]: For 53157/57095 co-relation queries the response was YES. [2021-12-07 00:12:35,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44783 conditions, 11480 events. 3688/11480 cut-off events. For 53157/57095 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 127731 event pairs, 726 based on Foata normal form. 272/11181 useless extension candidates. Maximal degree in co-relation 44738. Up to 2725 conditions per place. [2021-12-07 00:12:35,385 INFO L132 encePairwiseOnDemand]: 95/107 looper letters, 117 selfloop transitions, 32 changer transitions 8/321 dead transitions. [2021-12-07 00:12:35,386 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 321 transitions, 3023 flow [2021-12-07 00:12:35,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-07 00:12:35,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-12-07 00:12:35,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1455 transitions. [2021-12-07 00:12:35,387 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.799890049477735 [2021-12-07 00:12:35,388 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1455 transitions. [2021-12-07 00:12:35,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1455 transitions. [2021-12-07 00:12:35,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:12:35,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1455 transitions. [2021-12-07 00:12:35,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 85.58823529411765) internal successors, (1455), 17 states have internal predecessors, (1455), 0 states have call successors, (0), 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-07 00:12:35,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 107.0) internal successors, (1926), 18 states have internal predecessors, (1926), 0 states have call successors, (0), 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-07 00:12:35,392 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 107.0) internal successors, (1926), 18 states have internal predecessors, (1926), 0 states have call successors, (0), 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-07 00:12:35,392 INFO L186 Difference]: Start difference. First operand has 194 places, 277 transitions, 2371 flow. Second operand 17 states and 1455 transitions. [2021-12-07 00:12:35,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 321 transitions, 3023 flow [2021-12-07 00:12:35,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 321 transitions, 2852 flow, removed 77 selfloop flow, removed 7 redundant places. [2021-12-07 00:12:35,461 INFO L242 Difference]: Finished difference. Result has 206 places, 292 transitions, 2483 flow [2021-12-07 00:12:35,462 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=2225, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2483, PETRI_PLACES=206, PETRI_TRANSITIONS=292} [2021-12-07 00:12:35,462 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 110 predicate places. [2021-12-07 00:12:35,462 INFO L470 AbstractCegarLoop]: Abstraction has has 206 places, 292 transitions, 2483 flow [2021-12-07 00:12:35,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 83.625) internal successors, (1338), 16 states have internal predecessors, (1338), 0 states have call successors, (0), 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-07 00:12:35,463 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:12:35,463 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:12:35,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-07 00:12:35,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:12:35,666 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-07 00:12:35,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:12:35,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1308129123, now seen corresponding path program 7 times [2021-12-07 00:12:35,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:12:35,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064601113] [2021-12-07 00:12:35,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:12:35,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:12:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:12:35,752 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:12:35,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:12:35,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064601113] [2021-12-07 00:12:35,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064601113] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:12:35,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799968590] [2021-12-07 00:12:35,752 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-07 00:12:35,752 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:12:35,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:12:35,753 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:12:35,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-07 00:12:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:12:35,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-07 00:12:35,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:12:35,988 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:12:35,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:12:36,144 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:12:36,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799968590] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:12:36,144 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 00:12:36,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2021-12-07 00:12:36,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739881895] [2021-12-07 00:12:36,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 00:12:36,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-07 00:12:36,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:12:36,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-07 00:12:36,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-12-07 00:12:36,147 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 107 [2021-12-07 00:12:36,148 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 292 transitions, 2483 flow. Second operand has 18 states, 18 states have (on average 80.05555555555556) internal successors, (1441), 18 states have internal predecessors, (1441), 0 states have call successors, (0), 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-07 00:12:36,148 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:12:36,148 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 107 [2021-12-07 00:12:36,148 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:12:53,950 INFO L129 PetriNetUnfolder]: 54454/99686 cut-off events. [2021-12-07 00:12:53,950 INFO L130 PetriNetUnfolder]: For 491285/496834 co-relation queries the response was YES. [2021-12-07 00:12:54,896 INFO L84 FinitePrefix]: Finished finitePrefix Result has 398212 conditions, 99686 events. 54454/99686 cut-off events. For 491285/496834 co-relation queries the response was YES. Maximal size of possible extension queue 3055. Compared 1013016 event pairs, 2912 based on Foata normal form. 1108/99680 useless extension candidates. Maximal degree in co-relation 398163. Up to 15326 conditions per place. [2021-12-07 00:12:55,362 INFO L132 encePairwiseOnDemand]: 91/107 looper letters, 1052 selfloop transitions, 985 changer transitions 0/2207 dead transitions. [2021-12-07 00:12:55,362 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 2207 transitions, 23485 flow [2021-12-07 00:12:55,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2021-12-07 00:12:55,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2021-12-07 00:12:55,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 16676 transitions. [2021-12-07 00:12:55,375 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.775375459152834 [2021-12-07 00:12:55,375 INFO L72 ComplementDD]: Start complementDD. Operand 201 states and 16676 transitions. [2021-12-07 00:12:55,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 201 states and 16676 transitions. [2021-12-07 00:12:55,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:12:55,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 201 states and 16676 transitions. [2021-12-07 00:12:55,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 202 states, 201 states have (on average 82.96517412935323) internal successors, (16676), 201 states have internal predecessors, (16676), 0 states have call successors, (0), 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-07 00:12:55,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 202 states, 202 states have (on average 107.0) internal successors, (21614), 202 states have internal predecessors, (21614), 0 states have call successors, (0), 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-07 00:12:55,421 INFO L81 ComplementDD]: Finished complementDD. Result has 202 states, 202 states have (on average 107.0) internal successors, (21614), 202 states have internal predecessors, (21614), 0 states have call successors, (0), 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-07 00:12:55,421 INFO L186 Difference]: Start difference. First operand has 206 places, 292 transitions, 2483 flow. Second operand 201 states and 16676 transitions. [2021-12-07 00:12:55,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 2207 transitions, 23485 flow [2021-12-07 00:12:56,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 2207 transitions, 23334 flow, removed 66 selfloop flow, removed 9 redundant places. [2021-12-07 00:12:56,738 INFO L242 Difference]: Finished difference. Result has 546 places, 1329 transitions, 16364 flow [2021-12-07 00:12:56,738 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=2332, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=201, PETRI_FLOW=16364, PETRI_PLACES=546, PETRI_TRANSITIONS=1329} [2021-12-07 00:12:56,739 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 450 predicate places. [2021-12-07 00:12:56,739 INFO L470 AbstractCegarLoop]: Abstraction has has 546 places, 1329 transitions, 16364 flow [2021-12-07 00:12:56,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 80.05555555555556) internal successors, (1441), 18 states have internal predecessors, (1441), 0 states have call successors, (0), 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-07 00:12:56,739 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:12:56,740 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:12:56,759 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-07 00:12:56,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:12:56,940 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-07 00:12:56,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:12:56,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1656625861, now seen corresponding path program 8 times [2021-12-07 00:12:56,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:12:56,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669875417] [2021-12-07 00:12:56,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:12:56,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:12:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:12:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:12:57,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:12:57,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669875417] [2021-12-07 00:12:57,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669875417] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:12:57,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998458887] [2021-12-07 00:12:57,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-07 00:12:57,072 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:12:57,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:12:57,073 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:12:57,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-07 00:12:57,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-07 00:12:57,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 00:12:57,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-07 00:12:57,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:12:57,258 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 00:12:57,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:12:57,418 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 00:12:57,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998458887] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:12:57,418 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 00:12:57,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2021-12-07 00:12:57,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184351199] [2021-12-07 00:12:57,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 00:12:57,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-07 00:12:57,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:12:57,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-07 00:12:57,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2021-12-07 00:12:57,422 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 107 [2021-12-07 00:12:57,423 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 1329 transitions, 16364 flow. Second operand has 21 states, 21 states have (on average 79.38095238095238) internal successors, (1667), 21 states have internal predecessors, (1667), 0 states have call successors, (0), 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-07 00:12:57,423 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:12:57,423 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 107 [2021-12-07 00:12:57,424 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:14:01,009 INFO L129 PetriNetUnfolder]: 80067/145900 cut-off events. [2021-12-07 00:14:01,010 INFO L130 PetriNetUnfolder]: For 23355403/23370230 co-relation queries the response was YES. [2021-12-07 00:14:06,465 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2010505 conditions, 145900 events. 80067/145900 cut-off events. For 23355403/23370230 co-relation queries the response was YES. Maximal size of possible extension queue 4436. Compared 1542113 event pairs, 17143 based on Foata normal form. 1416/145105 useless extension candidates. Maximal degree in co-relation 2010307. Up to 46448 conditions per place. [2021-12-07 00:14:08,088 INFO L132 encePairwiseOnDemand]: 89/107 looper letters, 2456 selfloop transitions, 1181 changer transitions 0/3807 dead transitions. [2021-12-07 00:14:08,088 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 3807 transitions, 74201 flow [2021-12-07 00:14:08,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2021-12-07 00:14:08,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2021-12-07 00:14:08,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 9094 transitions. [2021-12-07 00:14:08,095 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7869505019037729 [2021-12-07 00:14:08,095 INFO L72 ComplementDD]: Start complementDD. Operand 108 states and 9094 transitions. [2021-12-07 00:14:08,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 9094 transitions. [2021-12-07 00:14:08,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:14:08,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 108 states and 9094 transitions. [2021-12-07 00:14:08,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 109 states, 108 states have (on average 84.20370370370371) internal successors, (9094), 108 states have internal predecessors, (9094), 0 states have call successors, (0), 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-07 00:14:08,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 109 states, 109 states have (on average 107.0) internal successors, (11663), 109 states have internal predecessors, (11663), 0 states have call successors, (0), 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-07 00:14:08,116 INFO L81 ComplementDD]: Finished complementDD. Result has 109 states, 109 states have (on average 107.0) internal successors, (11663), 109 states have internal predecessors, (11663), 0 states have call successors, (0), 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-07 00:14:08,116 INFO L186 Difference]: Start difference. First operand has 546 places, 1329 transitions, 16364 flow. Second operand 108 states and 9094 transitions. [2021-12-07 00:14:08,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 3807 transitions, 74201 flow [2021-12-07 00:15:32,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 3807 transitions, 69526 flow, removed 1246 selfloop flow, removed 3 redundant places. [2021-12-07 00:15:32,479 INFO L242 Difference]: Finished difference. Result has 711 places, 2405 transitions, 37315 flow [2021-12-07 00:15:32,480 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=14663, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=228, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1071, PETRI_DIFFERENCE_SUBTRAHEND_STATES=108, PETRI_FLOW=37315, PETRI_PLACES=711, PETRI_TRANSITIONS=2405} [2021-12-07 00:15:32,480 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 615 predicate places. [2021-12-07 00:15:32,480 INFO L470 AbstractCegarLoop]: Abstraction has has 711 places, 2405 transitions, 37315 flow [2021-12-07 00:15:32,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 79.38095238095238) internal successors, (1667), 21 states have internal predecessors, (1667), 0 states have call successors, (0), 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-07 00:15:32,480 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:15:32,481 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:15:32,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-07 00:15:32,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:15:32,682 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-07 00:15:32,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:15:32,683 INFO L85 PathProgramCache]: Analyzing trace with hash -2085904443, now seen corresponding path program 9 times [2021-12-07 00:15:32,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:15:32,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737155268] [2021-12-07 00:15:32,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:15:32,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:15:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:15:32,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:15:32,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:15:32,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737155268] [2021-12-07 00:15:32,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737155268] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:15:32,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032563228] [2021-12-07 00:15:32,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-07 00:15:32,814 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:15:32,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:15:32,815 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:15:32,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f2fc9f1-3389-427b-b227-042aa94d2e8d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-07 00:15:32,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-07 00:15:32,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 00:15:32,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-07 00:15:32,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:15:33,024 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 00:15:33,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:15:33,184 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 00:15:33,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032563228] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:15:33,184 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 00:15:33,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2021-12-07 00:15:33,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992170880] [2021-12-07 00:15:33,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 00:15:33,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-07 00:15:33,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:15:33,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-07 00:15:33,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2021-12-07 00:15:33,186 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 107 [2021-12-07 00:15:33,187 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 711 places, 2405 transitions, 37315 flow. Second operand has 20 states, 20 states have (on average 79.85) internal successors, (1597), 20 states have internal predecessors, (1597), 0 states have call successors, (0), 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-07 00:15:33,187 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:15:33,187 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 107 [2021-12-07 00:15:33,187 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand