./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/bench-exp3x3.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_1f137cd4-b7ab-42f2-a992-3145a61885c3/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f137cd4-b7ab-42f2-a992-3145a61885c3/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_1f137cd4-b7ab-42f2-a992-3145a61885c3/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f137cd4-b7ab-42f2-a992-3145a61885c3/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/bench-exp3x3.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f137cd4-b7ab-42f2-a992-3145a61885c3/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_1f137cd4-b7ab-42f2-a992-3145a61885c3/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 753355d7d8c08568df49ed9a7977f84d185e0dbf04984bcb7908b11aa84a04b9 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 19:54:30,354 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 19:54:30,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 19:54:30,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 19:54:30,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 19:54:30,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 19:54:30,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 19:54:30,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 19:54:30,387 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 19:54:30,388 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 19:54:30,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 19:54:30,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 19:54:30,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 19:54:30,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 19:54:30,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 19:54:30,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 19:54:30,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 19:54:30,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 19:54:30,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 19:54:30,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 19:54:30,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 19:54:30,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 19:54:30,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 19:54:30,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 19:54:30,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 19:54:30,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 19:54:30,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 19:54:30,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 19:54:30,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 19:54:30,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 19:54:30,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 19:54:30,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 19:54:30,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 19:54:30,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 19:54:30,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 19:54:30,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 19:54:30,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 19:54:30,413 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 19:54:30,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 19:54:30,414 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 19:54:30,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 19:54:30,416 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f137cd4-b7ab-42f2-a992-3145a61885c3/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 19:54:30,439 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 19:54:30,439 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 19:54:30,439 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 19:54:30,440 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 19:54:30,440 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 19:54:30,440 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 19:54:30,441 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 19:54:30,441 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 19:54:30,441 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 19:54:30,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 19:54:30,441 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 19:54:30,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 19:54:30,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 19:54:30,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 19:54:30,442 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 19:54:30,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 19:54:30,442 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 19:54:30,443 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 19:54:30,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 19:54:30,443 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 19:54:30,443 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 19:54:30,443 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 19:54:30,443 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 19:54:30,443 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 19:54:30,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 19:54:30,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 19:54:30,444 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 19:54:30,444 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 19:54:30,444 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 19:54:30,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 19:54:30,444 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 19:54:30,445 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 19:54:30,445 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 19:54:30,445 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 19:54:30,445 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_1f137cd4-b7ab-42f2-a992-3145a61885c3/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_1f137cd4-b7ab-42f2-a992-3145a61885c3/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 -> 753355d7d8c08568df49ed9a7977f84d185e0dbf04984bcb7908b11aa84a04b9 [2021-12-06 19:54:30,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 19:54:30,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 19:54:30,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 19:54:30,668 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 19:54:30,668 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 19:54:30,669 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f137cd4-b7ab-42f2-a992-3145a61885c3/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/weaver/bench-exp3x3.wvr.c [2021-12-06 19:54:30,715 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f137cd4-b7ab-42f2-a992-3145a61885c3/bin/uautomizer-DrprNOufMa/data/97009330a/029af2edc9704459b72f22deae126bdc/FLAG810bff194 [2021-12-06 19:54:31,086 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 19:54:31,087 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f137cd4-b7ab-42f2-a992-3145a61885c3/sv-benchmarks/c/weaver/bench-exp3x3.wvr.c [2021-12-06 19:54:31,094 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f137cd4-b7ab-42f2-a992-3145a61885c3/bin/uautomizer-DrprNOufMa/data/97009330a/029af2edc9704459b72f22deae126bdc/FLAG810bff194 [2021-12-06 19:54:31,107 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f137cd4-b7ab-42f2-a992-3145a61885c3/bin/uautomizer-DrprNOufMa/data/97009330a/029af2edc9704459b72f22deae126bdc [2021-12-06 19:54:31,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 19:54:31,110 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 19:54:31,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 19:54:31,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 19:54:31,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 19:54:31,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:54:31" (1/1) ... [2021-12-06 19:54:31,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6517b8af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:54:31, skipping insertion in model container [2021-12-06 19:54:31,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:54:31" (1/1) ... [2021-12-06 19:54:31,124 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 19:54:31,141 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 19:54:31,303 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_1f137cd4-b7ab-42f2-a992-3145a61885c3/sv-benchmarks/c/weaver/bench-exp3x3.wvr.c[2625,2638] [2021-12-06 19:54:31,307 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 19:54:31,314 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 19:54:31,340 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_1f137cd4-b7ab-42f2-a992-3145a61885c3/sv-benchmarks/c/weaver/bench-exp3x3.wvr.c[2625,2638] [2021-12-06 19:54:31,341 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 19:54:31,355 INFO L208 MainTranslator]: Completed translation [2021-12-06 19:54:31,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:54:31 WrapperNode [2021-12-06 19:54:31,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 19:54:31,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 19:54:31,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 19:54:31,357 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 19:54:31,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:54:31" (1/1) ... [2021-12-06 19:54:31,370 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:54:31" (1/1) ... [2021-12-06 19:54:31,388 INFO L137 Inliner]: procedures = 22, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2021-12-06 19:54:31,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 19:54:31,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 19:54:31,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 19:54:31,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 19:54:31,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:54:31" (1/1) ... [2021-12-06 19:54:31,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:54:31" (1/1) ... [2021-12-06 19:54:31,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:54:31" (1/1) ... [2021-12-06 19:54:31,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:54:31" (1/1) ... [2021-12-06 19:54:31,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:54:31" (1/1) ... [2021-12-06 19:54:31,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:54:31" (1/1) ... [2021-12-06 19:54:31,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:54:31" (1/1) ... [2021-12-06 19:54:31,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 19:54:31,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 19:54:31,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 19:54:31,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 19:54:31,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:54:31" (1/1) ... [2021-12-06 19:54:31,428 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 19:54:31,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f137cd4-b7ab-42f2-a992-3145a61885c3/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:54:31,448 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f137cd4-b7ab-42f2-a992-3145a61885c3/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 19:54:31,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f137cd4-b7ab-42f2-a992-3145a61885c3/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 19:54:31,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 19:54:31,479 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-12-06 19:54:31,479 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-12-06 19:54:31,479 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-12-06 19:54:31,479 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-12-06 19:54:31,480 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-12-06 19:54:31,480 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-12-06 19:54:31,480 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-12-06 19:54:31,480 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-12-06 19:54:31,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 19:54:31,480 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2021-12-06 19:54:31,480 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2021-12-06 19:54:31,480 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2021-12-06 19:54:31,480 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2021-12-06 19:54:31,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 19:54:31,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 19:54:31,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 19:54:31,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 19:54:31,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-06 19:54:31,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 19:54:31,482 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-06 19:54:31,560 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 19:54:31,562 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 19:54:31,759 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 19:54:31,767 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 19:54:31,767 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-06 19:54:31,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:54:31 BoogieIcfgContainer [2021-12-06 19:54:31,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 19:54:31,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 19:54:31,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 19:54:31,773 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 19:54:31,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:54:31" (1/3) ... [2021-12-06 19:54:31,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f82ae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:54:31, skipping insertion in model container [2021-12-06 19:54:31,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:54:31" (2/3) ... [2021-12-06 19:54:31,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f82ae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:54:31, skipping insertion in model container [2021-12-06 19:54:31,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:54:31" (3/3) ... [2021-12-06 19:54:31,775 INFO L111 eAbstractionObserver]: Analyzing ICFG bench-exp3x3.wvr.c [2021-12-06 19:54:31,779 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-06 19:54:31,779 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 19:54:31,779 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 19:54:31,779 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-06 19:54:31,810 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,810 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,810 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,810 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,811 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,811 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,811 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,812 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,812 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,812 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,813 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,813 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,814 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,814 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,814 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,814 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,815 WARN L322 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,815 WARN L322 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,815 WARN L322 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,815 WARN L322 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,816 WARN L322 ript$VariableManager]: TermVariabe |thread6Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,816 WARN L322 ript$VariableManager]: TermVariabe |thread6Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,816 WARN L322 ript$VariableManager]: TermVariabe |thread6Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,817 WARN L322 ript$VariableManager]: TermVariabe |thread6Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,820 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,820 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,823 WARN L322 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,824 WARN L322 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,825 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,825 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,826 WARN L322 ript$VariableManager]: TermVariabe |thread6Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,826 WARN L322 ript$VariableManager]: TermVariabe |thread6Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,827 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,828 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,828 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,829 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:54:31,835 INFO L148 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2021-12-06 19:54:31,884 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 19:54:31,893 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-06 19:54:31,893 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-12-06 19:54:31,904 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 174 places, 169 transitions, 386 flow [2021-12-06 19:54:31,957 INFO L129 PetriNetUnfolder]: 14/163 cut-off events. [2021-12-06 19:54:31,957 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-12-06 19:54:31,961 INFO L84 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 163 events. 14/163 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2021-12-06 19:54:31,961 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 169 transitions, 386 flow [2021-12-06 19:54:31,965 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 146 transitions, 328 flow [2021-12-06 19:54:31,991 INFO L129 PetriNetUnfolder]: 14/145 cut-off events. [2021-12-06 19:54:31,991 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-12-06 19:54:31,991 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:54:31,992 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:54:31,992 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2021-12-06 19:54:31,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:54:31,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1565365569, now seen corresponding path program 1 times [2021-12-06 19:54:32,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:54:32,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383543002] [2021-12-06 19:54:32,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:54:32,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:54:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:54:32,212 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-06 19:54:32,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:54:32,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383543002] [2021-12-06 19:54:32,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383543002] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:54:32,214 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:54:32,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 19:54:32,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438153539] [2021-12-06 19:54:32,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:54:32,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-06 19:54:32,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:54:32,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-06 19:54:32,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 19:54:32,251 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 169 [2021-12-06 19:54:32,256 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 146 transitions, 328 flow. Second operand has 2 states, 2 states have (on average 154.5) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 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-06 19:54:32,256 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:54:32,256 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 169 [2021-12-06 19:54:32,257 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:54:32,315 INFO L129 PetriNetUnfolder]: 6/138 cut-off events. [2021-12-06 19:54:32,315 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-12-06 19:54:32,317 INFO L84 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 138 events. 6/138 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 38/168 useless extension candidates. Maximal degree in co-relation 119. Up to 13 conditions per place. [2021-12-06 19:54:32,318 INFO L132 encePairwiseOnDemand]: 161/169 looper letters, 12 selfloop transitions, 0 changer transitions 2/138 dead transitions. [2021-12-06 19:54:32,318 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 138 transitions, 336 flow [2021-12-06 19:54:32,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-06 19:54:32,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-12-06 19:54:32,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 316 transitions. [2021-12-06 19:54:32,333 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9349112426035503 [2021-12-06 19:54:32,333 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 316 transitions. [2021-12-06 19:54:32,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 316 transitions. [2021-12-06 19:54:32,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:54:32,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 316 transitions. [2021-12-06 19:54:32,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 158.0) internal successors, (316), 2 states have internal predecessors, (316), 0 states have call successors, (0), 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-06 19:54:32,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 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-06 19:54:32,348 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 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-06 19:54:32,349 INFO L186 Difference]: Start difference. First operand has 151 places, 146 transitions, 328 flow. Second operand 2 states and 316 transitions. [2021-12-06 19:54:32,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 138 transitions, 336 flow [2021-12-06 19:54:32,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 138 transitions, 312 flow, removed 0 selfloop flow, removed 12 redundant places. [2021-12-06 19:54:32,359 INFO L242 Difference]: Finished difference. Result has 140 places, 136 transitions, 284 flow [2021-12-06 19:54:32,361 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=284, PETRI_PLACES=140, PETRI_TRANSITIONS=136} [2021-12-06 19:54:32,365 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, -11 predicate places. [2021-12-06 19:54:32,365 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 136 transitions, 284 flow [2021-12-06 19:54:32,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 154.5) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 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-06 19:54:32,366 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:54:32,366 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:54:32,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 19:54:32,367 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2021-12-06 19:54:32,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:54:32,368 INFO L85 PathProgramCache]: Analyzing trace with hash -616084000, now seen corresponding path program 1 times [2021-12-06 19:54:32,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:54:32,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659104787] [2021-12-06 19:54:32,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:54:32,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:54:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:54:32,915 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-06 19:54:32,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:54:32,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659104787] [2021-12-06 19:54:32,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659104787] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:54:32,915 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:54:32,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:54:32,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123668384] [2021-12-06 19:54:32,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:54:32,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:54:32,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:54:32,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:54:32,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:54:32,919 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 169 [2021-12-06 19:54:32,920 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 136 transitions, 284 flow. Second operand has 7 states, 7 states have (on average 113.42857142857143) internal successors, (794), 7 states have internal predecessors, (794), 0 states have call successors, (0), 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-06 19:54:32,921 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:54:32,921 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 169 [2021-12-06 19:54:32,921 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:54:35,097 INFO L129 PetriNetUnfolder]: 13855/19795 cut-off events. [2021-12-06 19:54:35,097 INFO L130 PetriNetUnfolder]: For 728/910 co-relation queries the response was YES. [2021-12-06 19:54:35,145 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37315 conditions, 19795 events. 13855/19795 cut-off events. For 728/910 co-relation queries the response was YES. Maximal size of possible extension queue 1028. Compared 113714 event pairs, 8389 based on Foata normal form. 1/13760 useless extension candidates. Maximal degree in co-relation 37312. Up to 10952 conditions per place. [2021-12-06 19:54:35,274 INFO L132 encePairwiseOnDemand]: 157/169 looper letters, 69 selfloop transitions, 9 changer transitions 4/168 dead transitions. [2021-12-06 19:54:35,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 168 transitions, 523 flow [2021-12-06 19:54:35,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 19:54:35,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-06 19:54:35,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 839 transitions. [2021-12-06 19:54:35,279 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7092138630600169 [2021-12-06 19:54:35,279 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 839 transitions. [2021-12-06 19:54:35,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 839 transitions. [2021-12-06 19:54:35,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:54:35,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 839 transitions. [2021-12-06 19:54:35,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 0 states have call successors, (0), 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-06 19:54:35,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 0 states have call successors, (0), 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-06 19:54:35,289 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 0 states have call successors, (0), 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-06 19:54:35,289 INFO L186 Difference]: Start difference. First operand has 140 places, 136 transitions, 284 flow. Second operand 7 states and 839 transitions. [2021-12-06 19:54:35,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 168 transitions, 523 flow [2021-12-06 19:54:35,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 168 transitions, 523 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-06 19:54:35,293 INFO L242 Difference]: Finished difference. Result has 147 places, 142 transitions, 339 flow [2021-12-06 19:54:35,293 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=339, PETRI_PLACES=147, PETRI_TRANSITIONS=142} [2021-12-06 19:54:35,294 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, -4 predicate places. [2021-12-06 19:54:35,294 INFO L470 AbstractCegarLoop]: Abstraction has has 147 places, 142 transitions, 339 flow [2021-12-06 19:54:35,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.42857142857143) internal successors, (794), 7 states have internal predecessors, (794), 0 states have call successors, (0), 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-06 19:54:35,295 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:54:35,295 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:54:35,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 19:54:35,295 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2021-12-06 19:54:35,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:54:35,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1758121540, now seen corresponding path program 1 times [2021-12-06 19:54:35,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:54:35,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361343522] [2021-12-06 19:54:35,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:54:35,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:54:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:54:35,569 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-06 19:54:35,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:54:35,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361343522] [2021-12-06 19:54:35,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361343522] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:54:35,570 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:54:35,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 19:54:35,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547887909] [2021-12-06 19:54:35,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:54:35,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 19:54:35,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:54:35,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 19:54:35,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:54:35,573 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2021-12-06 19:54:35,575 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 142 transitions, 339 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 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-06 19:54:35,575 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:54:35,575 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2021-12-06 19:54:35,575 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:54:37,285 INFO L129 PetriNetUnfolder]: 13532/20062 cut-off events. [2021-12-06 19:54:37,285 INFO L130 PetriNetUnfolder]: For 4486/4730 co-relation queries the response was YES. [2021-12-06 19:54:37,354 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44924 conditions, 20062 events. 13532/20062 cut-off events. For 4486/4730 co-relation queries the response was YES. Maximal size of possible extension queue 965. Compared 124546 event pairs, 1500 based on Foata normal form. 2/14619 useless extension candidates. Maximal degree in co-relation 44917. Up to 10954 conditions per place. [2021-12-06 19:54:37,434 INFO L132 encePairwiseOnDemand]: 156/169 looper letters, 84 selfloop transitions, 17 changer transitions 1/186 dead transitions. [2021-12-06 19:54:37,434 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 186 transitions, 665 flow [2021-12-06 19:54:37,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 19:54:37,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-06 19:54:37,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 740 transitions. [2021-12-06 19:54:37,437 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7297830374753451 [2021-12-06 19:54:37,437 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 740 transitions. [2021-12-06 19:54:37,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 740 transitions. [2021-12-06 19:54:37,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:54:37,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 740 transitions. [2021-12-06 19:54:37,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 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-06 19:54:37,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 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-06 19:54:37,443 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 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-06 19:54:37,443 INFO L186 Difference]: Start difference. First operand has 147 places, 142 transitions, 339 flow. Second operand 6 states and 740 transitions. [2021-12-06 19:54:37,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 186 transitions, 665 flow [2021-12-06 19:54:37,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 186 transitions, 644 flow, removed 2 selfloop flow, removed 5 redundant places. [2021-12-06 19:54:37,452 INFO L242 Difference]: Finished difference. Result has 147 places, 150 transitions, 411 flow [2021-12-06 19:54:37,452 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=411, PETRI_PLACES=147, PETRI_TRANSITIONS=150} [2021-12-06 19:54:37,453 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, -4 predicate places. [2021-12-06 19:54:37,453 INFO L470 AbstractCegarLoop]: Abstraction has has 147 places, 150 transitions, 411 flow [2021-12-06 19:54:37,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 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-06 19:54:37,454 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:54:37,454 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:54:37,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 19:54:37,455 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2021-12-06 19:54:37,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:54:37,456 INFO L85 PathProgramCache]: Analyzing trace with hash 793584122, now seen corresponding path program 2 times [2021-12-06 19:54:37,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:54:37,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399651705] [2021-12-06 19:54:37,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:54:37,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:54:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:54:37,575 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-06 19:54:37,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:54:37,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399651705] [2021-12-06 19:54:37,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399651705] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:54:37,576 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:54:37,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 19:54:37,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158904963] [2021-12-06 19:54:37,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:54:37,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 19:54:37,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:54:37,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 19:54:37,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:54:37,578 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 169 [2021-12-06 19:54:37,579 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 150 transitions, 411 flow. Second operand has 6 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 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-06 19:54:37,579 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:54:37,579 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 169 [2021-12-06 19:54:37,579 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:54:39,925 INFO L129 PetriNetUnfolder]: 20952/31681 cut-off events. [2021-12-06 19:54:39,926 INFO L130 PetriNetUnfolder]: For 12684/12915 co-relation queries the response was YES. [2021-12-06 19:54:40,033 INFO L84 FinitePrefix]: Finished finitePrefix Result has 69906 conditions, 31681 events. 20952/31681 cut-off events. For 12684/12915 co-relation queries the response was YES. Maximal size of possible extension queue 1730. Compared 220714 event pairs, 11477 based on Foata normal form. 634/24236 useless extension candidates. Maximal degree in co-relation 69899. Up to 6711 conditions per place. [2021-12-06 19:54:40,204 INFO L132 encePairwiseOnDemand]: 158/169 looper letters, 104 selfloop transitions, 15 changer transitions 0/223 dead transitions. [2021-12-06 19:54:40,204 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 223 transitions, 852 flow [2021-12-06 19:54:40,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 19:54:40,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-06 19:54:40,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 941 transitions. [2021-12-06 19:54:40,207 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7954353338968724 [2021-12-06 19:54:40,207 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 941 transitions. [2021-12-06 19:54:40,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 941 transitions. [2021-12-06 19:54:40,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:54:40,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 941 transitions. [2021-12-06 19:54:40,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.42857142857142) internal successors, (941), 7 states have internal predecessors, (941), 0 states have call successors, (0), 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-06 19:54:40,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 0 states have call successors, (0), 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-06 19:54:40,214 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 0 states have call successors, (0), 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-06 19:54:40,214 INFO L186 Difference]: Start difference. First operand has 147 places, 150 transitions, 411 flow. Second operand 7 states and 941 transitions. [2021-12-06 19:54:40,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 223 transitions, 852 flow [2021-12-06 19:54:40,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 223 transitions, 824 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-06 19:54:40,225 INFO L242 Difference]: Finished difference. Result has 153 places, 155 transitions, 472 flow [2021-12-06 19:54:40,225 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=472, PETRI_PLACES=153, PETRI_TRANSITIONS=155} [2021-12-06 19:54:40,226 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, 2 predicate places. [2021-12-06 19:54:40,226 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 155 transitions, 472 flow [2021-12-06 19:54:40,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 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-06 19:54:40,226 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:54:40,227 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:54:40,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 19:54:40,227 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2021-12-06 19:54:40,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:54:40,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1562844010, now seen corresponding path program 1 times [2021-12-06 19:54:40,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:54:40,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441080072] [2021-12-06 19:54:40,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:54:40,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:54:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:54:40,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:54:40,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:54:40,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441080072] [2021-12-06 19:54:40,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441080072] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:54:40,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868664688] [2021-12-06 19:54:40,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:54:40,357 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:54:40,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f137cd4-b7ab-42f2-a992-3145a61885c3/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:54:40,358 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f137cd4-b7ab-42f2-a992-3145a61885c3/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:54:40,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f137cd4-b7ab-42f2-a992-3145a61885c3/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 19:54:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:54:40,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 19:54:40,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:54:40,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:54:40,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:54:41,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:54:41,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868664688] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:54:41,539 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:54:41,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2021-12-06 19:54:41,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038203066] [2021-12-06 19:54:41,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:54:41,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 19:54:41,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:54:41,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 19:54:41,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-06 19:54:41,542 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 169 [2021-12-06 19:54:41,543 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 155 transitions, 472 flow. Second operand has 10 states, 10 states have (on average 123.3) internal successors, (1233), 10 states have internal predecessors, (1233), 0 states have call successors, (0), 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-06 19:54:41,543 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:54:41,543 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 169 [2021-12-06 19:54:41,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:54:47,240 INFO L129 PetriNetUnfolder]: 50113/75128 cut-off events. [2021-12-06 19:54:47,240 INFO L130 PetriNetUnfolder]: For 80131/81542 co-relation queries the response was YES. [2021-12-06 19:54:47,581 INFO L84 FinitePrefix]: Finished finitePrefix Result has 191498 conditions, 75128 events. 50113/75128 cut-off events. For 80131/81542 co-relation queries the response was YES. Maximal size of possible extension queue 3698. Compared 589842 event pairs, 7598 based on Foata normal form. 1208/59792 useless extension candidates. Maximal degree in co-relation 191488. Up to 15354 conditions per place. [2021-12-06 19:54:48,021 INFO L132 encePairwiseOnDemand]: 156/169 looper letters, 167 selfloop transitions, 22 changer transitions 0/294 dead transitions. [2021-12-06 19:54:48,021 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 294 transitions, 1458 flow [2021-12-06 19:54:48,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 19:54:48,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-06 19:54:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1573 transitions. [2021-12-06 19:54:48,025 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7756410256410257 [2021-12-06 19:54:48,026 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1573 transitions. [2021-12-06 19:54:48,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1573 transitions. [2021-12-06 19:54:48,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:54:48,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1573 transitions. [2021-12-06 19:54:48,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 131.08333333333334) internal successors, (1573), 12 states have internal predecessors, (1573), 0 states have call successors, (0), 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-06 19:54:48,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 169.0) internal successors, (2197), 13 states have internal predecessors, (2197), 0 states have call successors, (0), 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-06 19:54:48,034 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 169.0) internal successors, (2197), 13 states have internal predecessors, (2197), 0 states have call successors, (0), 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-06 19:54:48,034 INFO L186 Difference]: Start difference. First operand has 153 places, 155 transitions, 472 flow. Second operand 12 states and 1573 transitions. [2021-12-06 19:54:48,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 294 transitions, 1458 flow [2021-12-06 19:54:48,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 294 transitions, 1440 flow, removed 7 selfloop flow, removed 2 redundant places. [2021-12-06 19:54:48,114 INFO L242 Difference]: Finished difference. Result has 169 places, 167 transitions, 604 flow [2021-12-06 19:54:48,114 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=604, PETRI_PLACES=169, PETRI_TRANSITIONS=167} [2021-12-06 19:54:48,115 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, 18 predicate places. [2021-12-06 19:54:48,115 INFO L470 AbstractCegarLoop]: Abstraction has has 169 places, 167 transitions, 604 flow [2021-12-06 19:54:48,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 123.3) internal successors, (1233), 10 states have internal predecessors, (1233), 0 states have call successors, (0), 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-06 19:54:48,115 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:54:48,115 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:54:48,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f137cd4-b7ab-42f2-a992-3145a61885c3/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 19:54:48,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f137cd4-b7ab-42f2-a992-3145a61885c3/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:54:48,318 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2021-12-06 19:54:48,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:54:48,319 INFO L85 PathProgramCache]: Analyzing trace with hash 87096828, now seen corresponding path program 1 times [2021-12-06 19:54:48,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:54:48,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278373982] [2021-12-06 19:54:48,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:54:48,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:54:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:54:48,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:54:48,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:54:48,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278373982] [2021-12-06 19:54:48,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278373982] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:54:48,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162975829] [2021-12-06 19:54:48,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:54:48,687 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:54:48,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f137cd4-b7ab-42f2-a992-3145a61885c3/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:54:48,688 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f137cd4-b7ab-42f2-a992-3145a61885c3/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:54:48,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f137cd4-b7ab-42f2-a992-3145a61885c3/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 19:54:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:54:48,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 19:54:48,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:54:49,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:54:49,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:54:49,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:54:49,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162975829] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:54:49,324 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:54:49,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2021-12-06 19:54:49,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344184014] [2021-12-06 19:54:49,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:54:49,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-06 19:54:49,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:54:49,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-06 19:54:49,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-12-06 19:54:49,328 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2021-12-06 19:54:49,330 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 167 transitions, 604 flow. Second operand has 14 states, 14 states have (on average 110.92857142857143) internal successors, (1553), 14 states have internal predecessors, (1553), 0 states have call successors, (0), 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-06 19:54:49,330 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:54:49,330 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2021-12-06 19:54:49,330 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:54:59,971 INFO L129 PetriNetUnfolder]: 81740/122202 cut-off events. [2021-12-06 19:54:59,972 INFO L130 PetriNetUnfolder]: For 252386/253211 co-relation queries the response was YES. [2021-12-06 19:55:00,470 INFO L84 FinitePrefix]: Finished finitePrefix Result has 381847 conditions, 122202 events. 81740/122202 cut-off events. For 252386/253211 co-relation queries the response was YES. Maximal size of possible extension queue 4957. Compared 975015 event pairs, 25887 based on Foata normal form. 1881/108125 useless extension candidates. Maximal degree in co-relation 381830. Up to 34691 conditions per place. [2021-12-06 19:55:01,134 INFO L132 encePairwiseOnDemand]: 152/169 looper letters, 290 selfloop transitions, 36 changer transitions 1/411 dead transitions. [2021-12-06 19:55:01,134 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 411 transitions, 2493 flow [2021-12-06 19:55:01,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 19:55:01,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-06 19:55:01,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1725 transitions. [2021-12-06 19:55:01,140 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7290786136939983 [2021-12-06 19:55:01,140 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1725 transitions. [2021-12-06 19:55:01,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1725 transitions. [2021-12-06 19:55:01,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:55:01,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1725 transitions. [2021-12-06 19:55:01,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 123.21428571428571) internal successors, (1725), 14 states have internal predecessors, (1725), 0 states have call successors, (0), 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-06 19:55:01,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 169.0) internal successors, (2535), 15 states have internal predecessors, (2535), 0 states have call successors, (0), 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-06 19:55:01,149 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 169.0) internal successors, (2535), 15 states have internal predecessors, (2535), 0 states have call successors, (0), 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-06 19:55:01,149 INFO L186 Difference]: Start difference. First operand has 169 places, 167 transitions, 604 flow. Second operand 14 states and 1725 transitions. [2021-12-06 19:55:01,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 411 transitions, 2493 flow [2021-12-06 19:55:01,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 411 transitions, 2487 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-06 19:55:01,875 INFO L242 Difference]: Finished difference. Result has 187 places, 183 transitions, 852 flow [2021-12-06 19:55:01,876 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=852, PETRI_PLACES=187, PETRI_TRANSITIONS=183} [2021-12-06 19:55:01,876 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, 36 predicate places. [2021-12-06 19:55:01,876 INFO L470 AbstractCegarLoop]: Abstraction has has 187 places, 183 transitions, 852 flow [2021-12-06 19:55:01,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 110.92857142857143) internal successors, (1553), 14 states have internal predecessors, (1553), 0 states have call successors, (0), 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-06 19:55:01,877 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:55:01,877 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:55:01,897 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f137cd4-b7ab-42f2-a992-3145a61885c3/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 19:55:02,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f137cd4-b7ab-42f2-a992-3145a61885c3/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:55:02,079 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2021-12-06 19:55:02,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:55:02,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1417117332, now seen corresponding path program 2 times [2021-12-06 19:55:02,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:55:02,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664921857] [2021-12-06 19:55:02,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:55:02,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:55:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:55:02,326 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-06 19:55:02,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:55:02,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664921857] [2021-12-06 19:55:02,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664921857] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:55:02,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:55:02,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 19:55:02,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196738082] [2021-12-06 19:55:02,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:55:02,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 19:55:02,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:55:02,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 19:55:02,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:55:02,328 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2021-12-06 19:55:02,329 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 183 transitions, 852 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 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-06 19:55:02,329 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:55:02,329 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2021-12-06 19:55:02,329 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:55:13,263 INFO L129 PetriNetUnfolder]: 80515/116929 cut-off events. [2021-12-06 19:55:13,263 INFO L130 PetriNetUnfolder]: For 394482/394755 co-relation queries the response was YES. [2021-12-06 19:55:13,910 INFO L84 FinitePrefix]: Finished finitePrefix Result has 411060 conditions, 116929 events. 80515/116929 cut-off events. For 394482/394755 co-relation queries the response was YES. Maximal size of possible extension queue 5457. Compared 892701 event pairs, 40481 based on Foata normal form. 246/102493 useless extension candidates. Maximal degree in co-relation 411035. Up to 95798 conditions per place. [2021-12-06 19:55:14,705 INFO L132 encePairwiseOnDemand]: 156/169 looper letters, 123 selfloop transitions, 27 changer transitions 1/235 dead transitions. [2021-12-06 19:55:14,705 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 235 transitions, 1466 flow [2021-12-06 19:55:14,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 19:55:14,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-06 19:55:14,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions. [2021-12-06 19:55:14,708 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.727810650887574 [2021-12-06 19:55:14,708 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 738 transitions. [2021-12-06 19:55:14,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 738 transitions. [2021-12-06 19:55:14,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:55:14,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 738 transitions. [2021-12-06 19:55:14,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 0 states have call successors, (0), 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-06 19:55:14,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 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-06 19:55:14,712 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 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-06 19:55:14,712 INFO L186 Difference]: Start difference. First operand has 187 places, 183 transitions, 852 flow. Second operand 6 states and 738 transitions. [2021-12-06 19:55:14,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 235 transitions, 1466 flow [2021-12-06 19:55:15,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 235 transitions, 1431 flow, removed 10 selfloop flow, removed 4 redundant places. [2021-12-06 19:55:15,804 INFO L242 Difference]: Finished difference. Result has 190 places, 193 transitions, 1000 flow [2021-12-06 19:55:15,804 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1000, PETRI_PLACES=190, PETRI_TRANSITIONS=193} [2021-12-06 19:55:15,805 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, 39 predicate places. [2021-12-06 19:55:15,805 INFO L470 AbstractCegarLoop]: Abstraction has has 190 places, 193 transitions, 1000 flow [2021-12-06 19:55:15,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 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-06 19:55:15,805 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:55:15,805 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:55:15,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 19:55:15,806 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2021-12-06 19:55:15,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:55:15,806 INFO L85 PathProgramCache]: Analyzing trace with hash 260390758, now seen corresponding path program 1 times [2021-12-06 19:55:15,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:55:15,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38083068] [2021-12-06 19:55:15,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:55:15,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:55:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:55:15,896 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-06 19:55:15,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:55:15,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38083068] [2021-12-06 19:55:15,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38083068] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:55:15,896 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:55:15,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 19:55:15,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667613926] [2021-12-06 19:55:15,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:55:15,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 19:55:15,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:55:15,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 19:55:15,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:55:15,899 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 169 [2021-12-06 19:55:15,900 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 193 transitions, 1000 flow. Second operand has 6 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 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-06 19:55:15,900 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:55:15,900 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 169 [2021-12-06 19:55:15,900 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:55:22,402 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= v_~x5~0_1 (* v_~x5~0_2 2)) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), 1810#(<= (+ (* 4294967296 (div ~x6~0 4294967296)) ~n~0) (+ ~x6~0 (* 4294967296 (div ~n~0 4294967296)))), Black: 184#(and (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1794#true, 84#L62-1true, Black: 1799#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~n~0) (+ ~x3~0 (* 4294967296 (div ~n~0 4294967296)))) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1798#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 201#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), Black: 202#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0) (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)))) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 208#true, 177#true, 106#L46-1true, 15#L54-1true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))), Black: 217#(and (<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 212#(<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296)))), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 223#true, Black: 228#(<= (+ ~x4~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x4~0 4294967296)) ~n~0)), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, Black: 1003#true, Black: 1009#(<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* ~x2~0 (- 1))) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2021-12-06 19:55:22,402 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2021-12-06 19:55:22,402 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2021-12-06 19:55:22,402 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-06 19:55:22,402 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2021-12-06 19:55:22,437 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= v_~x5~0_1 (* v_~x5~0_2 2)) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1810#(<= (+ (* 4294967296 (div ~x6~0 4294967296)) ~n~0) (+ ~x6~0 (* 4294967296 (div ~n~0 4294967296)))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 184#(and (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1794#true, 84#L62-1true, Black: 1799#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~n~0) (+ ~x3~0 (* 4294967296 (div ~n~0 4294967296)))) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1798#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 201#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 202#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0) (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)))) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 208#true, 177#true, 106#L46-1true, 15#L54-1true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))), Black: 217#(and (<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 223#true, Black: 212#(<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296)))), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x4~0 4294967296)) ~n~0)), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, Black: 1003#true, Black: 1009#(<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* ~x2~0 (- 1))) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2021-12-06 19:55:22,437 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2021-12-06 19:55:22,437 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2021-12-06 19:55:22,437 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-06 19:55:22,437 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2021-12-06 19:55:23,023 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= v_~x5~0_1 (* v_~x5~0_2 2)) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), 1810#(<= (+ (* 4294967296 (div ~x6~0 4294967296)) ~n~0) (+ ~x6~0 (* 4294967296 (div ~n~0 4294967296)))), Black: 184#(and (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1794#true, 213#(<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))), 84#L62-1true, Black: 1799#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~n~0) (+ ~x3~0 (* 4294967296 (div ~n~0 4294967296)))) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1798#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 201#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), Black: 202#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0) (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)))) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 177#true, 106#L46-1true, 15#L54-1true, 61#L105-4true, Black: 208#true, Black: 217#(and (<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 212#(<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296)))), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 223#true, Black: 228#(<= (+ ~x4~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x4~0 4294967296)) ~n~0)), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, 1003#true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* ~x2~0 (- 1))) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2021-12-06 19:55:23,023 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2021-12-06 19:55:23,023 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2021-12-06 19:55:23,023 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-06 19:55:23,023 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2021-12-06 19:55:23,058 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= v_~x5~0_1 (* v_~x5~0_2 2)) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), 1810#(<= (+ (* 4294967296 (div ~x6~0 4294967296)) ~n~0) (+ ~x6~0 (* 4294967296 (div ~n~0 4294967296)))), Black: 184#(and (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1794#true, 213#(<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))), 84#L62-1true, Black: 1799#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~n~0) (+ ~x3~0 (* 4294967296 (div ~n~0 4294967296)))) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1798#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 201#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 202#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0) (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)))) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 177#true, 106#L46-1true, 15#L54-1true, 61#L105-4true, Black: 208#true, 223#true, Black: 217#(and (<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 212#(<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296)))), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x4~0 4294967296)) ~n~0)), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, 1003#true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* ~x2~0 (- 1))) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2021-12-06 19:55:23,058 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2021-12-06 19:55:23,058 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2021-12-06 19:55:23,058 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2021-12-06 19:55:23,058 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-06 19:55:23,876 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= v_~x5~0_1 (* v_~x5~0_2 2)) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1810#(<= (+ (* 4294967296 (div ~x6~0 4294967296)) ~n~0) (+ ~x6~0 (* 4294967296 (div ~n~0 4294967296)))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 184#(and (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1794#true, 84#L62-1true, Black: 1799#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~n~0) (+ ~x3~0 (* 4294967296 (div ~n~0 4294967296)))) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1798#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 201#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), Black: 202#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0) (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)))) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 208#true, 177#true, 106#L46-1true, 15#L54-1true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))), Black: 217#(and (<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 212#(<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296)))), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 223#true, Black: 228#(<= (+ ~x4~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x4~0 4294967296)) ~n~0)), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, 1003#true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* ~x2~0 (- 1))) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2021-12-06 19:55:23,876 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-12-06 19:55:23,877 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-06 19:55:23,877 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-06 19:55:23,877 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-06 19:55:23,877 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= v_~x5~0_1 (* v_~x5~0_2 2)) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1810#(<= (+ (* 4294967296 (div ~x6~0 4294967296)) ~n~0) (+ ~x6~0 (* 4294967296 (div ~n~0 4294967296)))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 184#(and (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1794#true, 84#L62-1true, 66#L47true, Black: 1799#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~n~0) (+ ~x3~0 (* 4294967296 (div ~n~0 4294967296)))) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1798#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 201#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), Black: 202#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0) (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)))) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 208#true, 177#true, 15#L54-1true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))), Black: 217#(and (<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 212#(<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296)))), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 223#true, Black: 228#(<= (+ ~x4~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x4~0 4294967296)) ~n~0)), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, Black: 1003#true, Black: 1009#(<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* ~x2~0 (- 1))) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2021-12-06 19:55:23,877 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2021-12-06 19:55:23,877 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-06 19:55:23,877 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-06 19:55:23,877 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-06 19:55:23,922 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= v_~x5~0_1 (* v_~x5~0_2 2)) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), 1810#(<= (+ (* 4294967296 (div ~x6~0 4294967296)) ~n~0) (+ ~x6~0 (* 4294967296 (div ~n~0 4294967296)))), Black: 184#(and (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1794#true, 84#L62-1true, Black: 1799#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~n~0) (+ ~x3~0 (* 4294967296 (div ~n~0 4294967296)))) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1798#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 201#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 202#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0) (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)))) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 208#true, 177#true, 106#L46-1true, 15#L54-1true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))), Black: 217#(and (<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 223#true, Black: 212#(<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296)))), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x4~0 4294967296)) ~n~0)), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, 1003#true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* ~x2~0 (- 1))) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2021-12-06 19:55:23,922 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-12-06 19:55:23,922 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-06 19:55:23,922 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-06 19:55:23,922 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-06 19:55:23,922 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= v_~x5~0_1 (* v_~x5~0_2 2)) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1810#(<= (+ (* 4294967296 (div ~x6~0 4294967296)) ~n~0) (+ ~x6~0 (* 4294967296 (div ~n~0 4294967296)))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 184#(and (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1794#true, 66#L47true, 84#L62-1true, Black: 1799#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~n~0) (+ ~x3~0 (* 4294967296 (div ~n~0 4294967296)))) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1798#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 201#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 202#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0) (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)))) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 208#true, 177#true, 15#L54-1true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))), Black: 217#(and (<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 223#true, Black: 212#(<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296)))), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x4~0 4294967296)) ~n~0)), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, Black: 1003#true, Black: 1009#(<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* ~x2~0 (- 1))) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2021-12-06 19:55:23,923 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2021-12-06 19:55:23,923 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-06 19:55:23,923 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-06 19:55:23,923 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-06 19:55:23,939 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= v_~x5~0_1 (* v_~x5~0_2 2)) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), 1810#(<= (+ (* 4294967296 (div ~x6~0 4294967296)) ~n~0) (+ ~x6~0 (* 4294967296 (div ~n~0 4294967296)))), Black: 184#(and (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1794#true, Black: 1799#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~n~0) (+ ~x3~0 (* 4294967296 (div ~n~0 4294967296)))) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1798#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 201#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), Black: 202#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0) (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)))) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 208#true, 177#true, 106#L46-1true, 15#L54-1true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))), Black: 217#(and (<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 212#(<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296)))), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 223#true, Black: 228#(<= (+ ~x4~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x4~0 4294967296)) ~n~0)), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, Black: 1003#true, Black: 1009#(<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* ~x2~0 (- 1))) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 55#L63true, Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2021-12-06 19:55:23,940 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2021-12-06 19:55:23,940 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-06 19:55:23,940 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-06 19:55:23,940 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-06 19:55:23,949 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= v_~x5~0_1 (* v_~x5~0_2 2)) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1810#(<= (+ (* 4294967296 (div ~x6~0 4294967296)) ~n~0) (+ ~x6~0 (* 4294967296 (div ~n~0 4294967296)))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 184#(and (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1794#true, 79#L55true, 84#L62-1true, Black: 1799#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~n~0) (+ ~x3~0 (* 4294967296 (div ~n~0 4294967296)))) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1798#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 201#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 202#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0) (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)))) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 208#true, 177#true, 106#L46-1true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))), Black: 217#(and (<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 223#true, Black: 212#(<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296)))), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x4~0 4294967296)) ~n~0)), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, Black: 1003#true, Black: 1009#(<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* ~x2~0 (- 1))) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2021-12-06 19:55:23,949 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2021-12-06 19:55:23,949 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-06 19:55:23,949 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-06 19:55:23,949 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-06 19:55:24,066 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= v_~x5~0_1 (* v_~x5~0_2 2)) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), 1810#(<= (+ (* 4294967296 (div ~x6~0 4294967296)) ~n~0) (+ ~x6~0 (* 4294967296 (div ~n~0 4294967296)))), Black: 184#(and (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1794#true, 213#(<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))), 84#L62-1true, Black: 1799#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~n~0) (+ ~x3~0 (* 4294967296 (div ~n~0 4294967296)))) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1798#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 201#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), Black: 202#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0) (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)))) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 177#true, 106#L46-1true, 15#L54-1true, 61#L105-4true, Black: 208#true, Black: 217#(and (<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 212#(<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296)))), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 223#true, Black: 228#(<= (+ ~x4~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x4~0 4294967296)) ~n~0)), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< 0 (mod ~x4~0 4294967296))), 1003#true, 57#L39true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* ~x2~0 (- 1))) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2021-12-06 19:55:24,066 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2021-12-06 19:55:24,066 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-06 19:55:24,066 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-06 19:55:24,066 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-06 19:55:24,226 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= v_~x5~0_1 (* v_~x5~0_2 2)) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), 1810#(<= (+ (* 4294967296 (div ~x6~0 4294967296)) ~n~0) (+ ~x6~0 (* 4294967296 (div ~n~0 4294967296)))), Black: 184#(and (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1794#true, 213#(<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))), 84#L62-1true, Black: 1799#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~n~0) (+ ~x3~0 (* 4294967296 (div ~n~0 4294967296)))) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1798#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 201#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 202#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0) (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)))) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 177#true, 106#L46-1true, 15#L54-1true, 61#L105-4true, Black: 208#true, Black: 217#(and (<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 223#true, Black: 212#(<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296)))), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x4~0 4294967296)) ~n~0)), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 1003#true, 57#L39true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* ~x2~0 (- 1))) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2021-12-06 19:55:24,226 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2021-12-06 19:55:24,226 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-06 19:55:24,226 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-06 19:55:24,226 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-06 19:55:24,547 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= v_~x5~0_1 (* v_~x5~0_2 2)) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1810#(<= (+ (* 4294967296 (div ~x6~0 4294967296)) ~n~0) (+ ~x6~0 (* 4294967296 (div ~n~0 4294967296)))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 184#(and (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1794#true, 213#(<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))), Black: 1799#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~n~0) (+ ~x3~0 (* 4294967296 (div ~n~0 4294967296)))) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1798#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 201#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), Black: 202#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0) (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)))) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 177#true, 106#L46-1true, 15#L54-1true, 61#L105-4true, Black: 208#true, Black: 217#(and (<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 212#(<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296)))), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 223#true, Black: 228#(<= (+ ~x4~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x4~0 4294967296)) ~n~0)), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, 1003#true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* ~x2~0 (- 1))) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 55#L63true, Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2021-12-06 19:55:24,547 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2021-12-06 19:55:24,547 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-06 19:55:24,547 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-06 19:55:24,547 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-06 19:55:24,557 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= v_~x5~0_1 (* v_~x5~0_2 2)) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1810#(<= (+ (* 4294967296 (div ~x6~0 4294967296)) ~n~0) (+ ~x6~0 (* 4294967296 (div ~n~0 4294967296)))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 184#(and (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1794#true, 79#L55true, 213#(<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))), 84#L62-1true, Black: 1799#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~n~0) (+ ~x3~0 (* 4294967296 (div ~n~0 4294967296)))) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1798#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 201#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 202#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0) (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)))) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 177#true, 106#L46-1true, 61#L105-4true, Black: 208#true, 223#true, Black: 217#(and (<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 212#(<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296)))), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x4~0 4294967296)) ~n~0)), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, 1003#true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* ~x2~0 (- 1))) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2021-12-06 19:55:24,557 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2021-12-06 19:55:24,557 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-06 19:55:24,557 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-06 19:55:24,557 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-06 19:55:25,384 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= v_~x5~0_1 (* v_~x5~0_2 2)) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), 1810#(<= (+ (* 4294967296 (div ~x6~0 4294967296)) ~n~0) (+ ~x6~0 (* 4294967296 (div ~n~0 4294967296)))), Black: 184#(and (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1794#true, 66#L47true, Black: 1799#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~n~0) (+ ~x3~0 (* 4294967296 (div ~n~0 4294967296)))) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1798#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 201#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), Black: 202#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0) (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)))) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 208#true, 177#true, 15#L54-1true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))), Black: 217#(and (<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 212#(<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296)))), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 223#true, Black: 228#(<= (+ ~x4~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x4~0 4294967296)) ~n~0)), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, Black: 1003#true, Black: 1009#(<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* ~x2~0 (- 1))) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 55#L63true, Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2021-12-06 19:55:25,384 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-12-06 19:55:25,384 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-06 19:55:25,384 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-06 19:55:25,384 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-06 19:55:25,385 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= v_~x5~0_1 (* v_~x5~0_2 2)) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1810#(<= (+ (* 4294967296 (div ~x6~0 4294967296)) ~n~0) (+ ~x6~0 (* 4294967296 (div ~n~0 4294967296)))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 184#(and (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1794#true, Black: 1799#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~n~0) (+ ~x3~0 (* 4294967296 (div ~n~0 4294967296)))) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1798#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 201#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), Black: 202#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0) (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)))) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 208#true, 177#true, 106#L46-1true, 15#L54-1true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))), Black: 217#(and (<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 212#(<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296)))), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 223#true, Black: 228#(<= (+ ~x4~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x4~0 4294967296)) ~n~0)), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, 1003#true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* ~x2~0 (- 1))) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 55#L63true, Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2021-12-06 19:55:25,385 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2021-12-06 19:55:25,385 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-06 19:55:25,385 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-06 19:55:25,385 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-06 19:55:25,396 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= v_~x5~0_1 (* v_~x5~0_2 2)) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), 1810#(<= (+ (* 4294967296 (div ~x6~0 4294967296)) ~n~0) (+ ~x6~0 (* 4294967296 (div ~n~0 4294967296)))), Black: 184#(and (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1794#true, 79#L55true, 84#L62-1true, Black: 1799#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~n~0) (+ ~x3~0 (* 4294967296 (div ~n~0 4294967296)))) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1798#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 201#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 202#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0) (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)))) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 208#true, 177#true, 106#L46-1true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))), Black: 217#(and (<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 223#true, Black: 212#(<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296)))), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x4~0 4294967296)) ~n~0)), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, 1003#true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* ~x2~0 (- 1))) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2021-12-06 19:55:25,396 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2021-12-06 19:55:25,396 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-06 19:55:25,396 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-06 19:55:25,396 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-06 19:55:25,397 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= v_~x5~0_1 (* v_~x5~0_2 2)) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), 1810#(<= (+ (* 4294967296 (div ~x6~0 4294967296)) ~n~0) (+ ~x6~0 (* 4294967296 (div ~n~0 4294967296)))), Black: 184#(and (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1794#true, 79#L55true, 84#L62-1true, 66#L47true, Black: 1799#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~n~0) (+ ~x3~0 (* 4294967296 (div ~n~0 4294967296)))) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1798#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 201#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 202#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0) (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)))) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 208#true, 177#true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))), Black: 217#(and (<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 223#true, Black: 212#(<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296)))), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x4~0 4294967296)) ~n~0)), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, Black: 1003#true, Black: 1009#(<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* ~x2~0 (- 1))) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2021-12-06 19:55:25,397 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-12-06 19:55:25,397 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-06 19:55:25,397 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-06 19:55:25,397 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-06 19:55:25,525 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= v_~x5~0_1 (* v_~x5~0_2 2)) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), 1810#(<= (+ (* 4294967296 (div ~x6~0 4294967296)) ~n~0) (+ ~x6~0 (* 4294967296 (div ~n~0 4294967296)))), Black: 184#(and (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1794#true, 213#(<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))), Black: 1799#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~n~0) (+ ~x3~0 (* 4294967296 (div ~n~0 4294967296)))) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1798#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 201#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), Black: 202#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0) (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)))) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 177#true, 106#L46-1true, 15#L54-1true, 61#L105-4true, Black: 208#true, Black: 217#(and (<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 212#(<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296)))), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 223#true, Black: 228#(<= (+ ~x4~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x4~0 4294967296)) ~n~0)), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< 0 (mod ~x4~0 4294967296))), 1003#true, 57#L39true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* ~x2~0 (- 1))) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 55#L63true, Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2021-12-06 19:55:25,525 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-12-06 19:55:25,525 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-06 19:55:25,525 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-06 19:55:25,525 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-06 19:55:25,534 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= v_~x5~0_1 (* v_~x5~0_2 2)) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1810#(<= (+ (* 4294967296 (div ~x6~0 4294967296)) ~n~0) (+ ~x6~0 (* 4294967296 (div ~n~0 4294967296)))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 184#(and (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1794#true, 79#L55true, 213#(<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))), 84#L62-1true, Black: 1799#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~n~0) (+ ~x3~0 (* 4294967296 (div ~n~0 4294967296)))) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1798#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 201#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 202#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0) (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)))) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 177#true, 106#L46-1true, 61#L105-4true, Black: 208#true, Black: 217#(and (<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 223#true, Black: 212#(<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296)))), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x4~0 4294967296)) ~n~0)), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 1003#true, 57#L39true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* ~x2~0 (- 1))) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2021-12-06 19:55:25,534 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-12-06 19:55:25,534 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-06 19:55:25,534 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-06 19:55:25,534 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-06 19:55:26,786 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= v_~x5~0_1 (* v_~x5~0_2 2)) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1810#(<= (+ (* 4294967296 (div ~x6~0 4294967296)) ~n~0) (+ ~x6~0 (* 4294967296 (div ~n~0 4294967296)))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 184#(and (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1794#true, 84#L62-1true, Black: 1799#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~n~0) (+ ~x3~0 (* 4294967296 (div ~n~0 4294967296)))) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1798#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 201#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 202#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0) (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)))) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 177#true, 208#true, 106#L46-1true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))), 223#true, Black: 217#(and (<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 212#(<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296)))), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 99#L54-2true, Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x4~0 4294967296)) ~n~0)), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, 1003#true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* ~x2~0 (- 1))) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2021-12-06 19:55:26,786 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2021-12-06 19:55:26,786 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-06 19:55:26,786 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-06 19:55:26,786 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-06 19:55:26,787 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([391] L46-1-->L46-2: Formula: (not (< (mod v_~x2~0_1 4294967296) (mod v_~n~0_3 4294967296))) InVars {~n~0=v_~n~0_3, ~x2~0=v_~x2~0_1} OutVars{~n~0=v_~n~0_3, ~x2~0=v_~x2~0_1} AuxVars[] AssignedVars[][146], [Black: 1774#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 184#(and (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1814#(and (<= (+ (* 4294967296 (div ~x6~0 4294967296)) ~n~0) (+ ~x6~0 (* 4294967296 (div ~n~0 4294967296)))) (<= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), 1794#true, 84#L62-1true, Black: 1799#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~n~0) (+ ~x3~0 (* 4294967296 (div ~n~0 4294967296)))) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1798#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 95#L46-2true, Black: 201#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 202#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0) (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)))) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 177#true, 208#true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))), 223#true, Black: 217#(and (<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 212#(<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296)))), 75#L78-2true, 26#L71true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 99#L54-2true, Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x4~0 4294967296)) ~n~0)), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, 1003#true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* ~x2~0 (- 1))) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2021-12-06 19:55:26,787 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2021-12-06 19:55:26,787 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-06 19:55:26,787 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-06 19:55:26,787 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-06 19:55:26,787 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L38-1-->L38-2: Formula: (not (< (mod v_~x1~0_1 4294967296) (mod v_~n~0_1 4294967296))) InVars {~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} OutVars{~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[][155], [Black: 1774#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 184#(and (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1814#(and (<= (+ (* 4294967296 (div ~x6~0 4294967296)) ~n~0) (+ ~x6~0 (* 4294967296 (div ~n~0 4294967296)))) (<= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), 1794#true, 84#L62-1true, Black: 1799#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~n~0) (+ ~x3~0 (* 4294967296 (div ~n~0 4294967296)))) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1798#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 201#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 202#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0) (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)))) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 177#true, 208#true, 106#L46-1true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))), 223#true, Black: 217#(and (<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 212#(<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296)))), 75#L78-2true, 26#L71true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 99#L54-2true, Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x4~0 4294967296)) ~n~0)), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 5#L38-2true, 1003#true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* ~x2~0 (- 1))) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2021-12-06 19:55:26,787 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2021-12-06 19:55:26,787 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-06 19:55:26,787 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-06 19:55:26,788 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-06 19:55:26,788 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([392] L46-1-->L47: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_4 4294967296)) InVars {~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][158], [Black: 1774#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 184#(and (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1814#(and (<= (+ (* 4294967296 (div ~x6~0 4294967296)) ~n~0) (+ ~x6~0 (* 4294967296 (div ~n~0 4294967296)))) (<= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), 1794#true, 84#L62-1true, 66#L47true, Black: 1799#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~n~0) (+ ~x3~0 (* 4294967296 (div ~n~0 4294967296)))) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 1798#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 201#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 202#(and (< (* 4294967296 (div ~x3~0 4294967296)) ~x3~0) (= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0) (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)))) (< (* 4294967296 (div ~x1~0 4294967296)) ~x1~0) (= (+ (* 4294967296 (div ~x6~0 4294967296)) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), 1009#(<= (+ ~x2~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x2~0 4294967296)) ~n~0)), 177#true, 208#true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))), 223#true, Black: 217#(and (<= (+ ~x1~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ ~n~0 (* 4294967296 (div ~x1~0 4294967296)))) (<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296))))), Black: 212#(<= (+ (* 4294967296 (div ~x2~0 4294967296)) ~x1~0) (+ ~x2~0 (* 4294967296 (div ~x1~0 4294967296)))), 75#L78-2true, 26#L71true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 99#L54-2true, Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* 4294967296 (div ~n~0 4294967296)) 1) (+ (* 4294967296 (div ~x4~0 4294967296)) ~n~0)), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 4294967296 (div ~x3~0 4294967296)) ~x4~0) (+ (* 4294967296 (div ~x4~0 4294967296)) ~x3~0)) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, Black: 1003#true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* ~x2~0 (- 1))) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2021-12-06 19:55:26,788 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2021-12-06 19:55:26,788 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-06 19:55:26,788 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-06 19:55:26,788 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-06 19:55:32,028 INFO L129 PetriNetUnfolder]: 115930/173971 cut-off events. [2021-12-06 19:55:32,028 INFO L130 PetriNetUnfolder]: For 526321/540429 co-relation queries the response was YES. [2021-12-06 19:55:33,456 INFO L84 FinitePrefix]: Finished finitePrefix Result has 585300 conditions, 173971 events. 115930/173971 cut-off events. For 526321/540429 co-relation queries the response was YES. Maximal size of possible extension queue 9829. Compared 1555373 event pairs, 18153 based on Foata normal form. 9016/161409 useless extension candidates. Maximal degree in co-relation 585272. Up to 58497 conditions per place. [2021-12-06 19:55:34,853 INFO L132 encePairwiseOnDemand]: 156/169 looper letters, 154 selfloop transitions, 39 changer transitions 0/310 dead transitions. [2021-12-06 19:55:34,853 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 310 transitions, 2207 flow [2021-12-06 19:55:34,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 19:55:34,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-06 19:55:34,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 926 transitions. [2021-12-06 19:55:34,856 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7827557058326289 [2021-12-06 19:55:34,856 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 926 transitions. [2021-12-06 19:55:34,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 926 transitions. [2021-12-06 19:55:34,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:55:34,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 926 transitions. [2021-12-06 19:55:34,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.28571428571428) internal successors, (926), 7 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:55:34,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 0 states have call successors, (0), 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-06 19:55:34,862 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 0 states have call successors, (0), 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-06 19:55:34,862 INFO L186 Difference]: Start difference. First operand has 190 places, 193 transitions, 1000 flow. Second operand 7 states and 926 transitions. [2021-12-06 19:55:34,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 310 transitions, 2207 flow [2021-12-06 19:55:39,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 310 transitions, 2152 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-12-06 19:55:39,885 INFO L242 Difference]: Finished difference. Result has 196 places, 213 transitions, 1252 flow [2021-12-06 19:55:39,886 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1252, PETRI_PLACES=196, PETRI_TRANSITIONS=213} [2021-12-06 19:55:39,886 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, 45 predicate places. [2021-12-06 19:55:39,886 INFO L470 AbstractCegarLoop]: Abstraction has has 196 places, 213 transitions, 1252 flow [2021-12-06 19:55:39,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 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-06 19:55:39,887 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:55:39,887 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:55:39,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 19:55:39,887 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2021-12-06 19:55:39,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:55:39,888 INFO L85 PathProgramCache]: Analyzing trace with hash 599558452, now seen corresponding path program 2 times [2021-12-06 19:55:39,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:55:39,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937618054] [2021-12-06 19:55:39,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:55:39,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:55:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:55:40,135 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-06 19:55:40,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:55:40,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937618054] [2021-12-06 19:55:40,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937618054] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:55:40,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:55:40,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 19:55:40,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478107563] [2021-12-06 19:55:40,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:55:40,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 19:55:40,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:55:40,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 19:55:40,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:55:40,138 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2021-12-06 19:55:40,139 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 213 transitions, 1252 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 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-06 19:55:40,139 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:55:40,139 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2021-12-06 19:55:40,139 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:55:59,672 INFO L129 PetriNetUnfolder]: 139589/197434 cut-off events. [2021-12-06 19:55:59,673 INFO L130 PetriNetUnfolder]: For 705826/705991 co-relation queries the response was YES. [2021-12-06 19:56:01,117 INFO L84 FinitePrefix]: Finished finitePrefix Result has 779949 conditions, 197434 events. 139589/197434 cut-off events. For 705826/705991 co-relation queries the response was YES. Maximal size of possible extension queue 8983. Compared 1546715 event pairs, 48684 based on Foata normal form. 146/195185 useless extension candidates. Maximal degree in co-relation 779918. Up to 168663 conditions per place. [2021-12-06 19:56:02,451 INFO L132 encePairwiseOnDemand]: 156/169 looper letters, 138 selfloop transitions, 43 changer transitions 2/267 dead transitions. [2021-12-06 19:56:02,451 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 267 transitions, 1992 flow [2021-12-06 19:56:02,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 19:56:02,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-06 19:56:02,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions. [2021-12-06 19:56:02,454 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.727810650887574 [2021-12-06 19:56:02,454 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 738 transitions. [2021-12-06 19:56:02,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 738 transitions. [2021-12-06 19:56:02,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:56:02,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 738 transitions. [2021-12-06 19:56:02,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 0 states have call successors, (0), 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-06 19:56:02,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 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-06 19:56:02,459 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 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-06 19:56:02,459 INFO L186 Difference]: Start difference. First operand has 196 places, 213 transitions, 1252 flow. Second operand 6 states and 738 transitions. [2021-12-06 19:56:02,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 267 transitions, 1992 flow [2021-12-06 19:56:06,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 267 transitions, 1988 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-06 19:56:06,699 INFO L242 Difference]: Finished difference. Result has 201 places, 219 transitions, 1459 flow [2021-12-06 19:56:06,699 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1459, PETRI_PLACES=201, PETRI_TRANSITIONS=219} [2021-12-06 19:56:06,699 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, 50 predicate places. [2021-12-06 19:56:06,700 INFO L470 AbstractCegarLoop]: Abstraction has has 201 places, 219 transitions, 1459 flow [2021-12-06 19:56:06,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 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-06 19:56:06,700 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:56:06,700 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:56:06,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 19:56:06,700 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2021-12-06 19:56:06,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:56:06,701 INFO L85 PathProgramCache]: Analyzing trace with hash 366735110, now seen corresponding path program 1 times [2021-12-06 19:56:06,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:56:06,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860696885] [2021-12-06 19:56:06,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:56:06,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:56:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:56:06,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:56:06,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:56:06,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860696885] [2021-12-06 19:56:06,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860696885] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:56:06,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533662970] [2021-12-06 19:56:06,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:56:06,909 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:56:06,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f137cd4-b7ab-42f2-a992-3145a61885c3/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:56:06,910 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f137cd4-b7ab-42f2-a992-3145a61885c3/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:56:06,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f137cd4-b7ab-42f2-a992-3145a61885c3/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 19:56:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:56:06,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 19:56:06,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:57:18,161 WARN L227 SmtUtils]: Spent 1.09m on a formula simplification. DAG size of input: 10359 DAG size of output: 2073 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-06 19:57:25,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:57:25,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:57:26,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:57:26,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533662970] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:57:26,097 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:57:26,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2021-12-06 19:57:26,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448385534] [2021-12-06 19:57:26,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:57:26,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-06 19:57:26,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:57:26,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-06 19:57:26,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-12-06 19:57:26,099 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2021-12-06 19:57:26,100 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 219 transitions, 1459 flow. Second operand has 14 states, 14 states have (on average 111.85714285714286) internal successors, (1566), 14 states have internal predecessors, (1566), 0 states have call successors, (0), 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-06 19:57:26,100 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:57:26,100 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2021-12-06 19:57:26,100 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:57:56,544 INFO L129 PetriNetUnfolder]: 198087/287101 cut-off events. [2021-12-06 19:57:56,544 INFO L130 PetriNetUnfolder]: For 1096845/1097065 co-relation queries the response was YES. [2021-12-06 19:57:58,749 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1148835 conditions, 287101 events. 198087/287101 cut-off events. For 1096845/1097065 co-relation queries the response was YES. Maximal size of possible extension queue 13613. Compared 2417959 event pairs, 16229 based on Foata normal form. 6919/292280 useless extension candidates. Maximal degree in co-relation 1148801. Up to 85352 conditions per place. [2021-12-06 19:58:00,708 INFO L132 encePairwiseOnDemand]: 152/169 looper letters, 397 selfloop transitions, 63 changer transitions 2/546 dead transitions. [2021-12-06 19:58:00,708 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 546 transitions, 4747 flow [2021-12-06 19:58:00,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 19:58:00,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-06 19:58:00,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1720 transitions. [2021-12-06 19:58:00,713 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7269653423499577 [2021-12-06 19:58:00,713 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1720 transitions. [2021-12-06 19:58:00,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1720 transitions. [2021-12-06 19:58:00,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:58:00,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1720 transitions. [2021-12-06 19:58:00,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 122.85714285714286) internal successors, (1720), 14 states have internal predecessors, (1720), 0 states have call successors, (0), 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-06 19:58:00,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 169.0) internal successors, (2535), 15 states have internal predecessors, (2535), 0 states have call successors, (0), 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-06 19:58:00,722 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 169.0) internal successors, (2535), 15 states have internal predecessors, (2535), 0 states have call successors, (0), 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-06 19:58:00,722 INFO L186 Difference]: Start difference. First operand has 201 places, 219 transitions, 1459 flow. Second operand 14 states and 1720 transitions. [2021-12-06 19:58:00,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 546 transitions, 4747 flow [2021-12-06 19:58:09,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 546 transitions, 4702 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-12-06 19:58:09,686 INFO L242 Difference]: Finished difference. Result has 218 places, 233 transitions, 1736 flow [2021-12-06 19:58:09,687 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=1407, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1736, PETRI_PLACES=218, PETRI_TRANSITIONS=233} [2021-12-06 19:58:09,687 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, 67 predicate places. [2021-12-06 19:58:09,687 INFO L470 AbstractCegarLoop]: Abstraction has has 218 places, 233 transitions, 1736 flow [2021-12-06 19:58:09,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 111.85714285714286) internal successors, (1566), 14 states have internal predecessors, (1566), 0 states have call successors, (0), 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-06 19:58:09,688 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:58:09,688 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:58:09,708 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f137cd4-b7ab-42f2-a992-3145a61885c3/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 19:58:09,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f137cd4-b7ab-42f2-a992-3145a61885c3/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-06 19:58:09,890 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2021-12-06 19:58:09,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:58:09,891 INFO L85 PathProgramCache]: Analyzing trace with hash 2012313894, now seen corresponding path program 2 times [2021-12-06 19:58:09,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:58:09,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137415314] [2021-12-06 19:58:09,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:58:09,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:58:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:58:10,173 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-06 19:58:10,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:58:10,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137415314] [2021-12-06 19:58:10,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137415314] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:58:10,174 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:58:10,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 19:58:10,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341282934] [2021-12-06 19:58:10,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:58:10,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 19:58:10,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:58:10,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 19:58:10,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:58:10,175 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2021-12-06 19:58:10,176 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 233 transitions, 1736 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 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-06 19:58:10,176 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:58:10,176 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2021-12-06 19:58:10,176 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:58:40,494 INFO L129 PetriNetUnfolder]: 194904/277715 cut-off events. [2021-12-06 19:58:40,495 INFO L130 PetriNetUnfolder]: For 1242967/1243178 co-relation queries the response was YES. [2021-12-06 19:58:43,008 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1231170 conditions, 277715 events. 194904/277715 cut-off events. For 1242967/1243178 co-relation queries the response was YES. Maximal size of possible extension queue 13682. Compared 2288468 event pairs, 73232 based on Foata normal form. 73/275452 useless extension candidates. Maximal degree in co-relation 1231130. Up to 238338 conditions per place. [2021-12-06 19:58:45,161 INFO L132 encePairwiseOnDemand]: 157/169 looper letters, 150 selfloop transitions, 47 changer transitions 4/285 dead transitions. [2021-12-06 19:58:45,161 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 285 transitions, 2540 flow [2021-12-06 19:58:45,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 19:58:45,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-06 19:58:45,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 737 transitions. [2021-12-06 19:58:45,164 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7268244575936884 [2021-12-06 19:58:45,164 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 737 transitions. [2021-12-06 19:58:45,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 737 transitions. [2021-12-06 19:58:45,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:58:45,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 737 transitions. [2021-12-06 19:58:45,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 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-06 19:58:45,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 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-06 19:58:45,169 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 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-06 19:58:45,169 INFO L186 Difference]: Start difference. First operand has 218 places, 233 transitions, 1736 flow. Second operand 6 states and 737 transitions. [2021-12-06 19:58:45,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 285 transitions, 2540 flow [2021-12-06 19:59:30,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 285 transitions, 2477 flow, removed 5 selfloop flow, removed 5 redundant places. [2021-12-06 19:59:30,851 INFO L242 Difference]: Finished difference. Result has 220 places, 239 transitions, 1920 flow [2021-12-06 19:59:30,851 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=1567, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1920, PETRI_PLACES=220, PETRI_TRANSITIONS=239} [2021-12-06 19:59:30,852 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, 69 predicate places. [2021-12-06 19:59:30,852 INFO L470 AbstractCegarLoop]: Abstraction has has 220 places, 239 transitions, 1920 flow [2021-12-06 19:59:30,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 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-06 19:59:30,852 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:59:30,852 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:59:30,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 19:59:30,853 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2021-12-06 19:59:30,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:59:30,853 INFO L85 PathProgramCache]: Analyzing trace with hash -471650856, now seen corresponding path program 3 times [2021-12-06 19:59:30,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:59:30,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757294273] [2021-12-06 19:59:30,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:59:30,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:59:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:59:31,088 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-06 19:59:31,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:59:31,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757294273] [2021-12-06 19:59:31,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757294273] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:59:31,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:59:31,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:59:31,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922485787] [2021-12-06 19:59:31,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:59:31,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:59:31,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:59:31,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:59:31,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:59:31,091 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2021-12-06 19:59:31,092 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 239 transitions, 1920 flow. Second operand has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 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-06 19:59:31,092 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:59:31,092 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2021-12-06 19:59:31,092 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:00:07,413 INFO L129 PetriNetUnfolder]: 220380/319249 cut-off events. [2021-12-06 20:00:07,413 INFO L130 PetriNetUnfolder]: For 1441397/1441706 co-relation queries the response was YES. [2021-12-06 20:00:10,316 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1385885 conditions, 319249 events. 220380/319249 cut-off events. For 1441397/1441706 co-relation queries the response was YES. Maximal size of possible extension queue 15303. Compared 2708677 event pairs, 72903 based on Foata normal form. 4524/318284 useless extension candidates. Maximal degree in co-relation 1385842. Up to 157873 conditions per place. [2021-12-06 20:00:12,557 INFO L132 encePairwiseOnDemand]: 157/169 looper letters, 193 selfloop transitions, 54 changer transitions 2/333 dead transitions. [2021-12-06 20:00:12,557 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 333 transitions, 3095 flow [2021-12-06 20:00:12,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 20:00:12,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-06 20:00:12,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 864 transitions. [2021-12-06 20:00:12,559 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7303465765004227 [2021-12-06 20:00:12,559 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 864 transitions. [2021-12-06 20:00:12,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 864 transitions. [2021-12-06 20:00:12,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:00:12,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 864 transitions. [2021-12-06 20:00:12,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.42857142857143) internal successors, (864), 7 states have internal predecessors, (864), 0 states have call successors, (0), 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-06 20:00:12,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 0 states have call successors, (0), 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-06 20:00:12,564 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 0 states have call successors, (0), 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-06 20:00:12,565 INFO L186 Difference]: Start difference. First operand has 220 places, 239 transitions, 1920 flow. Second operand 7 states and 864 transitions. [2021-12-06 20:00:12,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 333 transitions, 3095 flow [2021-12-06 20:01:26,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 333 transitions, 3040 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-12-06 20:01:26,608 INFO L242 Difference]: Finished difference. Result has 225 places, 241 transitions, 2052 flow [2021-12-06 20:01:26,608 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=1865, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2052, PETRI_PLACES=225, PETRI_TRANSITIONS=241} [2021-12-06 20:01:26,609 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, 74 predicate places. [2021-12-06 20:01:26,609 INFO L470 AbstractCegarLoop]: Abstraction has has 225 places, 241 transitions, 2052 flow [2021-12-06 20:01:26,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 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-06 20:01:26,610 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:01:26,610 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:01:26,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 20:01:26,610 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2021-12-06 20:01:26,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:01:26,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1987679976, now seen corresponding path program 1 times [2021-12-06 20:01:26,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:01:26,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908224666] [2021-12-06 20:01:26,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:01:26,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:01:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:01:26,875 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-06 20:01:26,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:01:26,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908224666] [2021-12-06 20:01:26,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908224666] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:01:26,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:01:26,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 20:01:26,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921105490] [2021-12-06 20:01:26,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:01:26,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 20:01:26,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:01:26,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 20:01:26,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:01:26,878 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2021-12-06 20:01:26,879 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 241 transitions, 2052 flow. Second operand has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 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-06 20:01:26,879 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:01:26,879 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2021-12-06 20:01:26,879 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:02:10,889 INFO L129 PetriNetUnfolder]: 253280/356605 cut-off events. [2021-12-06 20:02:10,889 INFO L130 PetriNetUnfolder]: For 1854758/1855129 co-relation queries the response was YES. [2021-12-06 20:02:14,145 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1649547 conditions, 356605 events. 253280/356605 cut-off events. For 1854758/1855129 co-relation queries the response was YES. Maximal size of possible extension queue 16855. Compared 2918371 event pairs, 90850 based on Foata normal form. 5727/354904 useless extension candidates. Maximal degree in co-relation 1649503. Up to 184776 conditions per place. [2021-12-06 20:02:16,862 INFO L132 encePairwiseOnDemand]: 157/169 looper letters, 205 selfloop transitions, 63 changer transitions 2/354 dead transitions. [2021-12-06 20:02:16,862 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 354 transitions, 3670 flow [2021-12-06 20:02:16,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 20:02:16,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-06 20:02:16,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 864 transitions. [2021-12-06 20:02:16,865 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7303465765004227 [2021-12-06 20:02:16,865 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 864 transitions. [2021-12-06 20:02:16,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 864 transitions. [2021-12-06 20:02:16,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:02:16,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 864 transitions. [2021-12-06 20:02:16,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.42857142857143) internal successors, (864), 7 states have internal predecessors, (864), 0 states have call successors, (0), 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-06 20:02:16,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 0 states have call successors, (0), 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-06 20:02:16,869 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 0 states have call successors, (0), 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-06 20:02:16,869 INFO L186 Difference]: Start difference. First operand has 225 places, 241 transitions, 2052 flow. Second operand 7 states and 864 transitions. [2021-12-06 20:02:16,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 354 transitions, 3670 flow