./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2657a253-2edb-46cb-a356-7364d9c2aaa2/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2657a253-2edb-46cb-a356-7364d9c2aaa2/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2657a253-2edb-46cb-a356-7364d9c2aaa2/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2657a253-2edb-46cb-a356-7364d9c2aaa2/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2657a253-2edb-46cb-a356-7364d9c2aaa2/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2657a253-2edb-46cb-a356-7364d9c2aaa2/bin/uautomizer-vX5HgA9Q3a --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 31f5db4bc5916150a86a586587dbeca1bc7aa37b414274f5dc02856908270171 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 14:04:11,415 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 14:04:11,417 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 14:04:11,442 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 14:04:11,442 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 14:04:11,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 14:04:11,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 14:04:11,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 14:04:11,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 14:04:11,458 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 14:04:11,458 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 14:04:11,460 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 14:04:11,460 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 14:04:11,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 14:04:11,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 14:04:11,465 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 14:04:11,467 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 14:04:11,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 14:04:11,474 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 14:04:11,481 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 14:04:11,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 14:04:11,488 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 14:04:11,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 14:04:11,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 14:04:11,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 14:04:11,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 14:04:11,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 14:04:11,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 14:04:11,498 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 14:04:11,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 14:04:11,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 14:04:11,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 14:04:11,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 14:04:11,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 14:04:11,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 14:04:11,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 14:04:11,507 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 14:04:11,508 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 14:04:11,508 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 14:04:11,512 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 14:04:11,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 14:04:11,513 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2657a253-2edb-46cb-a356-7364d9c2aaa2/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 14:04:11,561 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 14:04:11,561 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 14:04:11,562 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 14:04:11,562 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 14:04:11,563 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 14:04:11,563 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 14:04:11,564 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 14:04:11,564 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 14:04:11,564 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 14:04:11,564 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 14:04:11,564 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 14:04:11,565 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 14:04:11,565 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 14:04:11,565 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 14:04:11,565 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 14:04:11,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 14:04:11,566 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 14:04:11,566 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 14:04:11,566 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 14:04:11,566 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 14:04:11,566 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 14:04:11,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 14:04:11,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 14:04:11,567 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 14:04:11,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 14:04:11,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 14:04:11,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 14:04:11,568 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 14:04:11,568 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 14:04:11,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 14:04:11,569 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 14:04:11,569 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 14:04:11,569 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 14:04:11,569 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_2657a253-2edb-46cb-a356-7364d9c2aaa2/bin/uautomizer-vX5HgA9Q3a/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_2657a253-2edb-46cb-a356-7364d9c2aaa2/bin/uautomizer-vX5HgA9Q3a 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 -> 31f5db4bc5916150a86a586587dbeca1bc7aa37b414274f5dc02856908270171 [2022-11-21 14:04:11,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 14:04:11,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 14:04:11,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 14:04:11,827 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 14:04:11,827 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 14:04:11,828 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2657a253-2edb-46cb-a356-7364d9c2aaa2/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs.i [2022-11-21 14:04:14,809 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 14:04:15,026 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 14:04:15,027 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2657a253-2edb-46cb-a356-7364d9c2aaa2/sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs.i [2022-11-21 14:04:15,040 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2657a253-2edb-46cb-a356-7364d9c2aaa2/bin/uautomizer-vX5HgA9Q3a/data/f089eafdc/a9d8d51ac10a469f9281e03098957e0e/FLAG9563a9930 [2022-11-21 14:04:15,055 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2657a253-2edb-46cb-a356-7364d9c2aaa2/bin/uautomizer-vX5HgA9Q3a/data/f089eafdc/a9d8d51ac10a469f9281e03098957e0e [2022-11-21 14:04:15,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 14:04:15,059 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 14:04:15,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 14:04:15,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 14:04:15,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 14:04:15,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 02:04:15" (1/1) ... [2022-11-21 14:04:15,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a33b44f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:15, skipping insertion in model container [2022-11-21 14:04:15,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 02:04:15" (1/1) ... [2022-11-21 14:04:15,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 14:04:15,115 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 14:04:15,271 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-21 14:04:15,453 WARN L237 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_2657a253-2edb-46cb-a356-7364d9c2aaa2/sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs.i[30893,30906] [2022-11-21 14:04:15,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 14:04:15,479 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 14:04:15,511 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-21 14:04:15,539 WARN L237 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_2657a253-2edb-46cb-a356-7364d9c2aaa2/sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs.i[30893,30906] [2022-11-21 14:04:15,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 14:04:15,588 INFO L208 MainTranslator]: Completed translation [2022-11-21 14:04:15,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:15 WrapperNode [2022-11-21 14:04:15,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 14:04:15,591 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 14:04:15,591 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 14:04:15,591 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 14:04:15,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:15" (1/1) ... [2022-11-21 14:04:15,629 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:15" (1/1) ... [2022-11-21 14:04:15,659 INFO L138 Inliner]: procedures = 173, calls = 24, calls flagged for inlining = 5, calls inlined = 7, statements flattened = 108 [2022-11-21 14:04:15,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 14:04:15,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 14:04:15,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 14:04:15,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 14:04:15,671 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:15" (1/1) ... [2022-11-21 14:04:15,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:15" (1/1) ... [2022-11-21 14:04:15,674 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:15" (1/1) ... [2022-11-21 14:04:15,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:15" (1/1) ... [2022-11-21 14:04:15,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:15" (1/1) ... [2022-11-21 14:04:15,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:15" (1/1) ... [2022-11-21 14:04:15,695 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:15" (1/1) ... [2022-11-21 14:04:15,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:15" (1/1) ... [2022-11-21 14:04:15,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 14:04:15,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 14:04:15,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 14:04:15,700 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 14:04:15,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:15" (1/1) ... [2022-11-21 14:04:15,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 14:04:15,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2657a253-2edb-46cb-a356-7364d9c2aaa2/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:04:15,738 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2657a253-2edb-46cb-a356-7364d9c2aaa2/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 14:04:15,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2657a253-2edb-46cb-a356-7364d9c2aaa2/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 14:04:15,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 14:04:15,788 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-21 14:04:15,788 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-21 14:04:15,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 14:04:15,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 14:04:15,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 14:04:15,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 14:04:15,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 14:04:15,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 14:04:15,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 14:04:15,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 14:04:15,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 14:04:15,792 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 14:04:15,927 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 14:04:15,944 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 14:04:16,289 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 14:04:16,384 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 14:04:16,385 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-21 14:04:16,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:04:16 BoogieIcfgContainer [2022-11-21 14:04:16,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 14:04:16,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 14:04:16,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 14:04:16,393 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 14:04:16,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 02:04:15" (1/3) ... [2022-11-21 14:04:16,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a854959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 02:04:16, skipping insertion in model container [2022-11-21 14:04:16,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:15" (2/3) ... [2022-11-21 14:04:16,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a854959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 02:04:16, skipping insertion in model container [2022-11-21 14:04:16,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:04:16" (3/3) ... [2022-11-21 14:04:16,396 INFO L112 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs.i [2022-11-21 14:04:16,405 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-21 14:04:16,417 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 14:04:16,417 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-21 14:04:16,417 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 14:04:16,493 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 14:04:16,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 75 transitions, 155 flow [2022-11-21 14:04:16,599 INFO L130 PetriNetUnfolder]: 8/113 cut-off events. [2022-11-21 14:04:16,603 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 14:04:16,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 113 events. 8/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 208 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2022-11-21 14:04:16,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 75 transitions, 155 flow [2022-11-21 14:04:16,613 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 75 transitions, 155 flow [2022-11-21 14:04:16,632 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 14:04:16,638 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3e596997, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 14:04:16,638 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-21 14:04:16,674 INFO L130 PetriNetUnfolder]: 4/51 cut-off events. [2022-11-21 14:04:16,684 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 14:04:16,684 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:04:16,685 INFO L209 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] [2022-11-21 14:04:16,686 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-21 14:04:16,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:16,695 INFO L85 PathProgramCache]: Analyzing trace with hash 24858482, now seen corresponding path program 1 times [2022-11-21 14:04:16,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:16,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783599940] [2022-11-21 14:04:16,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:16,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:16,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:04:16,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:16,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783599940] [2022-11-21 14:04:16,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783599940] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:04:16,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:04:16,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 14:04:16,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941253534] [2022-11-21 14:04:16,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:04:16,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 14:04:16,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:16,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 14:04:16,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 14:04:16,938 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 75 [2022-11-21 14:04:16,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 75 transitions, 155 flow. Second operand has 2 states, 2 states have (on average 62.5) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:16,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:04:16,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 75 [2022-11-21 14:04:16,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:04:17,029 INFO L130 PetriNetUnfolder]: 18/173 cut-off events. [2022-11-21 14:04:17,030 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-21 14:04:17,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 173 events. 18/173 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 500 event pairs, 9 based on Foata normal form. 13/164 useless extension candidates. Maximal degree in co-relation 152. Up to 38 conditions per place. [2022-11-21 14:04:17,034 INFO L137 encePairwiseOnDemand]: 72/75 looper letters, 9 selfloop transitions, 0 changer transitions 0/70 dead transitions. [2022-11-21 14:04:17,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 70 transitions, 163 flow [2022-11-21 14:04:17,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 14:04:17,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-21 14:04:17,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 134 transitions. [2022-11-21 14:04:17,050 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8933333333333333 [2022-11-21 14:04:17,050 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 134 transitions. [2022-11-21 14:04:17,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 134 transitions. [2022-11-21 14:04:17,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:04:17,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 134 transitions. [2022-11-21 14:04:17,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:17,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:17,069 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:17,071 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 155 flow. Second operand 2 states and 134 transitions. [2022-11-21 14:04:17,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 70 transitions, 163 flow [2022-11-21 14:04:17,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 70 transitions, 163 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 14:04:17,081 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 145 flow [2022-11-21 14:04:17,084 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=145, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2022-11-21 14:04:17,103 INFO L288 CegarLoopForPetriNet]: 73 programPoint places, -1 predicate places. [2022-11-21 14:04:17,103 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 145 flow [2022-11-21 14:04:17,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.5) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:17,104 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:04:17,104 INFO L209 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] [2022-11-21 14:04:17,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 14:04:17,104 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-21 14:04:17,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:17,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1969669199, now seen corresponding path program 1 times [2022-11-21 14:04:17,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:17,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989178642] [2022-11-21 14:04:17,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:17,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:17,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:04:17,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:17,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989178642] [2022-11-21 14:04:17,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989178642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:04:17,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:04:17,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 14:04:17,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994384074] [2022-11-21 14:04:17,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:04:17,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 14:04:17,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:17,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 14:04:17,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 14:04:17,407 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 75 [2022-11-21 14:04:17,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:17,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:04:17,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 75 [2022-11-21 14:04:17,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:04:17,512 INFO L130 PetriNetUnfolder]: 57/289 cut-off events. [2022-11-21 14:04:17,513 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-21 14:04:17,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 289 events. 57/289 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1143 event pairs, 20 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 417. Up to 80 conditions per place. [2022-11-21 14:04:17,515 INFO L137 encePairwiseOnDemand]: 69/75 looper letters, 22 selfloop transitions, 4 changer transitions 6/84 dead transitions. [2022-11-21 14:04:17,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 84 transitions, 237 flow [2022-11-21 14:04:17,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 14:04:17,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 14:04:17,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 190 transitions. [2022-11-21 14:04:17,518 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8444444444444444 [2022-11-21 14:04:17,518 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 190 transitions. [2022-11-21 14:04:17,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 190 transitions. [2022-11-21 14:04:17,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:04:17,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 190 transitions. [2022-11-21 14:04:17,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:17,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:17,522 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:17,522 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 145 flow. Second operand 3 states and 190 transitions. [2022-11-21 14:04:17,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 84 transitions, 237 flow [2022-11-21 14:04:17,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 84 transitions, 237 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 14:04:17,525 INFO L231 Difference]: Finished difference. Result has 76 places, 72 transitions, 173 flow [2022-11-21 14:04:17,525 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=173, PETRI_PLACES=76, PETRI_TRANSITIONS=72} [2022-11-21 14:04:17,526 INFO L288 CegarLoopForPetriNet]: 73 programPoint places, 3 predicate places. [2022-11-21 14:04:17,526 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 72 transitions, 173 flow [2022-11-21 14:04:17,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:17,527 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:04:17,527 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:17,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 14:04:17,528 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-21 14:04:17,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:17,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1114984198, now seen corresponding path program 1 times [2022-11-21 14:04:17,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:17,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158717496] [2022-11-21 14:04:17,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:17,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 14:04:17,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 14:04:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 14:04:17,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 14:04:17,577 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 14:04:17,578 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2022-11-21 14:04:17,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-11-21 14:04:17,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-11-21 14:04:17,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-11-21 14:04:17,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 14:04:17,581 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-21 14:04:17,585 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-21 14:04:17,587 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-21 14:04:17,619 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 14:04:17,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 93 transitions, 198 flow [2022-11-21 14:04:17,663 INFO L130 PetriNetUnfolder]: 13/171 cut-off events. [2022-11-21 14:04:17,663 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-21 14:04:17,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 171 events. 13/171 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 436 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 114. Up to 6 conditions per place. [2022-11-21 14:04:17,668 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 93 transitions, 198 flow [2022-11-21 14:04:17,670 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 93 transitions, 198 flow [2022-11-21 14:04:17,677 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 14:04:17,682 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3e596997, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 14:04:17,682 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-21 14:04:17,687 INFO L130 PetriNetUnfolder]: 4/51 cut-off events. [2022-11-21 14:04:17,688 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 14:04:17,689 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:04:17,689 INFO L209 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] [2022-11-21 14:04:17,689 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-21 14:04:17,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:17,691 INFO L85 PathProgramCache]: Analyzing trace with hash -403506638, now seen corresponding path program 1 times [2022-11-21 14:04:17,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:17,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647585844] [2022-11-21 14:04:17,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:17,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:17,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:04:17,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:17,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647585844] [2022-11-21 14:04:17,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647585844] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:04:17,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:04:17,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 14:04:17,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976230209] [2022-11-21 14:04:17,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:04:17,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 14:04:17,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:17,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 14:04:17,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 14:04:17,758 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2022-11-21 14:04:17,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 93 transitions, 198 flow. Second operand has 2 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:17,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:04:17,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2022-11-21 14:04:17,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:04:17,936 INFO L130 PetriNetUnfolder]: 150/610 cut-off events. [2022-11-21 14:04:17,937 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-21 14:04:17,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 863 conditions, 610 events. 150/610 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3423 event pairs, 93 based on Foata normal form. 75/577 useless extension candidates. Maximal degree in co-relation 627. Up to 234 conditions per place. [2022-11-21 14:04:17,942 INFO L137 encePairwiseOnDemand]: 89/93 looper letters, 14 selfloop transitions, 0 changer transitions 0/86 dead transitions. [2022-11-21 14:04:17,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 86 transitions, 212 flow [2022-11-21 14:04:17,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 14:04:17,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-21 14:04:17,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 162 transitions. [2022-11-21 14:04:17,949 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8709677419354839 [2022-11-21 14:04:17,949 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 162 transitions. [2022-11-21 14:04:17,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 162 transitions. [2022-11-21 14:04:17,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:04:17,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 162 transitions. [2022-11-21 14:04:17,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 81.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:17,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:17,954 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:17,954 INFO L175 Difference]: Start difference. First operand has 91 places, 93 transitions, 198 flow. Second operand 2 states and 162 transitions. [2022-11-21 14:04:17,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 86 transitions, 212 flow [2022-11-21 14:04:17,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 86 transitions, 210 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-11-21 14:04:17,959 INFO L231 Difference]: Finished difference. Result has 89 places, 86 transitions, 182 flow [2022-11-21 14:04:17,960 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=182, PETRI_PLACES=89, PETRI_TRANSITIONS=86} [2022-11-21 14:04:17,963 INFO L288 CegarLoopForPetriNet]: 91 programPoint places, -2 predicate places. [2022-11-21 14:04:17,963 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 86 transitions, 182 flow [2022-11-21 14:04:17,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:17,963 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:04:17,964 INFO L209 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] [2022-11-21 14:04:17,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 14:04:17,964 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-21 14:04:17,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:17,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1667315025, now seen corresponding path program 1 times [2022-11-21 14:04:17,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:17,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598743634] [2022-11-21 14:04:17,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:17,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:18,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:04:18,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:18,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598743634] [2022-11-21 14:04:18,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598743634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:04:18,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:04:18,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 14:04:18,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583866818] [2022-11-21 14:04:18,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:04:18,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 14:04:18,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:18,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 14:04:18,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 14:04:18,161 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 93 [2022-11-21 14:04:18,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 86 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:18,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:04:18,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 93 [2022-11-21 14:04:18,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:04:18,597 INFO L130 PetriNetUnfolder]: 1077/2517 cut-off events. [2022-11-21 14:04:18,598 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-11-21 14:04:18,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4257 conditions, 2517 events. 1077/2517 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 17292 event pairs, 352 based on Foata normal form. 0/2168 useless extension candidates. Maximal degree in co-relation 4252. Up to 1021 conditions per place. [2022-11-21 14:04:18,612 INFO L137 encePairwiseOnDemand]: 84/93 looper letters, 43 selfloop transitions, 6 changer transitions 0/108 dead transitions. [2022-11-21 14:04:18,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 108 transitions, 329 flow [2022-11-21 14:04:18,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 14:04:18,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 14:04:18,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2022-11-21 14:04:18,615 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8207885304659498 [2022-11-21 14:04:18,615 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 229 transitions. [2022-11-21 14:04:18,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 229 transitions. [2022-11-21 14:04:18,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:04:18,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 229 transitions. [2022-11-21 14:04:18,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:18,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:18,619 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:18,619 INFO L175 Difference]: Start difference. First operand has 89 places, 86 transitions, 182 flow. Second operand 3 states and 229 transitions. [2022-11-21 14:04:18,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 108 transitions, 329 flow [2022-11-21 14:04:18,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 108 transitions, 329 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 14:04:18,623 INFO L231 Difference]: Finished difference. Result has 93 places, 92 transitions, 236 flow [2022-11-21 14:04:18,624 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=93, PETRI_TRANSITIONS=92} [2022-11-21 14:04:18,625 INFO L288 CegarLoopForPetriNet]: 91 programPoint places, 2 predicate places. [2022-11-21 14:04:18,626 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 92 transitions, 236 flow [2022-11-21 14:04:18,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:18,626 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:04:18,627 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:18,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 14:04:18,627 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-21 14:04:18,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:18,628 INFO L85 PathProgramCache]: Analyzing trace with hash -767453885, now seen corresponding path program 1 times [2022-11-21 14:04:18,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:18,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623830389] [2022-11-21 14:04:18,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:18,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 14:04:18,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 14:04:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 14:04:18,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 14:04:18,692 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 14:04:18,695 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-11-21 14:04:18,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-21 14:04:18,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-11-21 14:04:18,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-11-21 14:04:18,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-21 14:04:18,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 14:04:18,698 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-21 14:04:18,699 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-21 14:04:18,699 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-21 14:04:18,748 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 14:04:18,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 111 transitions, 243 flow [2022-11-21 14:04:18,782 INFO L130 PetriNetUnfolder]: 18/229 cut-off events. [2022-11-21 14:04:18,782 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-21 14:04:18,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 229 events. 18/229 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 671 event pairs, 0 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 175. Up to 8 conditions per place. [2022-11-21 14:04:18,784 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 111 transitions, 243 flow [2022-11-21 14:04:18,786 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 111 transitions, 243 flow [2022-11-21 14:04:18,787 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 14:04:18,790 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3e596997, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 14:04:18,790 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-21 14:04:18,795 INFO L130 PetriNetUnfolder]: 4/52 cut-off events. [2022-11-21 14:04:18,795 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 14:04:18,795 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:04:18,795 INFO L209 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] [2022-11-21 14:04:18,796 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 14:04:18,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:18,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1301976178, now seen corresponding path program 1 times [2022-11-21 14:04:18,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:18,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224980538] [2022-11-21 14:04:18,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:18,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:04:18,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:18,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224980538] [2022-11-21 14:04:18,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224980538] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:04:18,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:04:18,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 14:04:18,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731821916] [2022-11-21 14:04:18,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:04:18,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 14:04:18,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:18,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 14:04:18,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 14:04:18,831 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 111 [2022-11-21 14:04:18,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 111 transitions, 243 flow. Second operand has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:18,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:04:18,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 111 [2022-11-21 14:04:18,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:04:19,201 INFO L130 PetriNetUnfolder]: 934/2503 cut-off events. [2022-11-21 14:04:19,202 INFO L131 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2022-11-21 14:04:19,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3862 conditions, 2503 events. 934/2503 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 18758 event pairs, 621 based on Foata normal form. 389/2398 useless extension candidates. Maximal degree in co-relation 2905. Up to 1274 conditions per place. [2022-11-21 14:04:19,225 INFO L137 encePairwiseOnDemand]: 106/111 looper letters, 19 selfloop transitions, 0 changer transitions 0/102 dead transitions. [2022-11-21 14:04:19,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 102 transitions, 263 flow [2022-11-21 14:04:19,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 14:04:19,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-21 14:04:19,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 190 transitions. [2022-11-21 14:04:19,227 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8558558558558559 [2022-11-21 14:04:19,227 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 190 transitions. [2022-11-21 14:04:19,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 190 transitions. [2022-11-21 14:04:19,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:04:19,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 190 transitions. [2022-11-21 14:04:19,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 95.0) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:19,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:19,230 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:19,230 INFO L175 Difference]: Start difference. First operand has 109 places, 111 transitions, 243 flow. Second operand 2 states and 190 transitions. [2022-11-21 14:04:19,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 102 transitions, 263 flow [2022-11-21 14:04:19,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 102 transitions, 257 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-11-21 14:04:19,233 INFO L231 Difference]: Finished difference. Result has 106 places, 102 transitions, 219 flow [2022-11-21 14:04:19,233 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=219, PETRI_PLACES=106, PETRI_TRANSITIONS=102} [2022-11-21 14:04:19,234 INFO L288 CegarLoopForPetriNet]: 109 programPoint places, -3 predicate places. [2022-11-21 14:04:19,234 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 102 transitions, 219 flow [2022-11-21 14:04:19,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:19,235 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:04:19,235 INFO L209 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] [2022-11-21 14:04:19,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 14:04:19,235 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 14:04:19,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:19,236 INFO L85 PathProgramCache]: Analyzing trace with hash 919134927, now seen corresponding path program 1 times [2022-11-21 14:04:19,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:19,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67352415] [2022-11-21 14:04:19,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:19,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:19,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:04:19,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:19,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67352415] [2022-11-21 14:04:19,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67352415] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:04:19,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:04:19,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 14:04:19,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354816973] [2022-11-21 14:04:19,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:04:19,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 14:04:19,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:19,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 14:04:19,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 14:04:19,317 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 111 [2022-11-21 14:04:19,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 102 transitions, 219 flow. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:19,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:04:19,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 111 [2022-11-21 14:04:19,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:04:22,912 INFO L130 PetriNetUnfolder]: 15145/26404 cut-off events. [2022-11-21 14:04:22,913 INFO L131 PetriNetUnfolder]: For 205/205 co-relation queries the response was YES. [2022-11-21 14:04:22,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47580 conditions, 26404 events. 15145/26404 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 1170. Compared 223573 event pairs, 5877 based on Foata normal form. 0/22557 useless extension candidates. Maximal degree in co-relation 47574. Up to 12218 conditions per place. [2022-11-21 14:04:23,141 INFO L137 encePairwiseOnDemand]: 99/111 looper letters, 58 selfloop transitions, 8 changer transitions 0/132 dead transitions. [2022-11-21 14:04:23,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 132 transitions, 421 flow [2022-11-21 14:04:23,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 14:04:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 14:04:23,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2022-11-21 14:04:23,143 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8048048048048048 [2022-11-21 14:04:23,143 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 268 transitions. [2022-11-21 14:04:23,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 268 transitions. [2022-11-21 14:04:23,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:04:23,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 268 transitions. [2022-11-21 14:04:23,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:23,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:23,146 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:23,146 INFO L175 Difference]: Start difference. First operand has 106 places, 102 transitions, 219 flow. Second operand 3 states and 268 transitions. [2022-11-21 14:04:23,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 132 transitions, 421 flow [2022-11-21 14:04:23,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 132 transitions, 421 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 14:04:23,150 INFO L231 Difference]: Finished difference. Result has 110 places, 110 transitions, 291 flow [2022-11-21 14:04:23,151 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=291, PETRI_PLACES=110, PETRI_TRANSITIONS=110} [2022-11-21 14:04:23,151 INFO L288 CegarLoopForPetriNet]: 109 programPoint places, 1 predicate places. [2022-11-21 14:04:23,151 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 110 transitions, 291 flow [2022-11-21 14:04:23,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:23,152 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:04:23,152 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:23,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 14:04:23,153 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 14:04:23,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:23,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1474153519, now seen corresponding path program 1 times [2022-11-21 14:04:23,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:23,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024927712] [2022-11-21 14:04:23,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:23,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:23,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 14:04:23,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:23,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024927712] [2022-11-21 14:04:23,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024927712] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:04:23,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:04:23,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 14:04:23,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253187150] [2022-11-21 14:04:23,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:04:23,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 14:04:23,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:23,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 14:04:23,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 14:04:23,651 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 111 [2022-11-21 14:04:23,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 110 transitions, 291 flow. Second operand has 6 states, 6 states have (on average 76.83333333333333) internal successors, (461), 6 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:23,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:04:23,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 111 [2022-11-21 14:04:23,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:04:25,404 INFO L130 PetriNetUnfolder]: 4513/11833 cut-off events. [2022-11-21 14:04:25,404 INFO L131 PetriNetUnfolder]: For 1409/1683 co-relation queries the response was YES. [2022-11-21 14:04:25,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21126 conditions, 11833 events. 4513/11833 cut-off events. For 1409/1683 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 124324 event pairs, 970 based on Foata normal form. 0/10498 useless extension candidates. Maximal degree in co-relation 21118. Up to 3938 conditions per place. [2022-11-21 14:04:25,515 INFO L137 encePairwiseOnDemand]: 99/111 looper letters, 64 selfloop transitions, 25 changer transitions 0/172 dead transitions. [2022-11-21 14:04:25,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 172 transitions, 623 flow [2022-11-21 14:04:25,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 14:04:25,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 14:04:25,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 540 transitions. [2022-11-21 14:04:25,518 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8108108108108109 [2022-11-21 14:04:25,518 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 540 transitions. [2022-11-21 14:04:25,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 540 transitions. [2022-11-21 14:04:25,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:04:25,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 540 transitions. [2022-11-21 14:04:25,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.0) internal successors, (540), 6 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:25,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:25,523 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:25,523 INFO L175 Difference]: Start difference. First operand has 110 places, 110 transitions, 291 flow. Second operand 6 states and 540 transitions. [2022-11-21 14:04:25,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 172 transitions, 623 flow [2022-11-21 14:04:25,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 172 transitions, 607 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 14:04:25,536 INFO L231 Difference]: Finished difference. Result has 116 places, 136 transitions, 430 flow [2022-11-21 14:04:25,536 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=430, PETRI_PLACES=116, PETRI_TRANSITIONS=136} [2022-11-21 14:04:25,537 INFO L288 CegarLoopForPetriNet]: 109 programPoint places, 7 predicate places. [2022-11-21 14:04:25,537 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 136 transitions, 430 flow [2022-11-21 14:04:25,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.83333333333333) internal successors, (461), 6 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:25,538 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:04:25,538 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:25,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 14:04:25,539 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 14:04:25,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:25,539 INFO L85 PathProgramCache]: Analyzing trace with hash -696341705, now seen corresponding path program 2 times [2022-11-21 14:04:25,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:25,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632408212] [2022-11-21 14:04:25,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:25,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:25,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:04:25,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:25,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632408212] [2022-11-21 14:04:25,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632408212] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:04:25,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305305864] [2022-11-21 14:04:25,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 14:04:25,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:04:25,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2657a253-2edb-46cb-a356-7364d9c2aaa2/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:04:25,851 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2657a253-2edb-46cb-a356-7364d9c2aaa2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:04:25,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2657a253-2edb-46cb-a356-7364d9c2aaa2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 14:04:25,968 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 14:04:25,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 14:04:25,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-21 14:04:25,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:04:26,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 14:04:26,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:04:26,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:04:26,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:04:26,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305305864] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 14:04:26,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 14:04:26,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 14 [2022-11-21 14:04:26,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675895254] [2022-11-21 14:04:26,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 14:04:26,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-21 14:04:26,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:26,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-21 14:04:26,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-11-21 14:04:26,482 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 111 [2022-11-21 14:04:26,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 136 transitions, 430 flow. Second operand has 14 states, 14 states have (on average 59.57142857142857) internal successors, (834), 14 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:26,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:04:26,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 111 [2022-11-21 14:04:26,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:04:37,431 INFO L130 PetriNetUnfolder]: 43702/76305 cut-off events. [2022-11-21 14:04:37,432 INFO L131 PetriNetUnfolder]: For 24586/24667 co-relation queries the response was YES. [2022-11-21 14:04:37,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178632 conditions, 76305 events. 43702/76305 cut-off events. For 24586/24667 co-relation queries the response was YES. Maximal size of possible extension queue 2851. Compared 739662 event pairs, 3459 based on Foata normal form. 3336/74574 useless extension candidates. Maximal degree in co-relation 178621. Up to 12109 conditions per place. [2022-11-21 14:04:38,313 INFO L137 encePairwiseOnDemand]: 85/111 looper letters, 402 selfloop transitions, 277 changer transitions 0/736 dead transitions. [2022-11-21 14:04:38,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 736 transitions, 3854 flow [2022-11-21 14:04:38,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-21 14:04:38,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-11-21 14:04:38,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 2651 transitions. [2022-11-21 14:04:38,322 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7024377318494965 [2022-11-21 14:04:38,322 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 2651 transitions. [2022-11-21 14:04:38,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 2651 transitions. [2022-11-21 14:04:38,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:04:38,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 2651 transitions. [2022-11-21 14:04:38,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 77.97058823529412) internal successors, (2651), 34 states have internal predecessors, (2651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:38,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 111.0) internal successors, (3885), 35 states have internal predecessors, (3885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:38,343 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 111.0) internal successors, (3885), 35 states have internal predecessors, (3885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:38,343 INFO L175 Difference]: Start difference. First operand has 116 places, 136 transitions, 430 flow. Second operand 34 states and 2651 transitions. [2022-11-21 14:04:38,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 736 transitions, 3854 flow [2022-11-21 14:04:38,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 736 transitions, 3854 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 14:04:38,363 INFO L231 Difference]: Finished difference. Result has 176 places, 397 transitions, 2770 flow [2022-11-21 14:04:38,363 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2770, PETRI_PLACES=176, PETRI_TRANSITIONS=397} [2022-11-21 14:04:38,366 INFO L288 CegarLoopForPetriNet]: 109 programPoint places, 67 predicate places. [2022-11-21 14:04:38,366 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 397 transitions, 2770 flow [2022-11-21 14:04:38,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 59.57142857142857) internal successors, (834), 14 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:38,367 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:04:38,367 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:38,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2657a253-2edb-46cb-a356-7364d9c2aaa2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-21 14:04:38,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2657a253-2edb-46cb-a356-7364d9c2aaa2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-21 14:04:38,574 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 14:04:38,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:38,575 INFO L85 PathProgramCache]: Analyzing trace with hash 659824388, now seen corresponding path program 1 times [2022-11-21 14:04:38,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:38,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179100601] [2022-11-21 14:04:38,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:38,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-21 14:04:38,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:38,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179100601] [2022-11-21 14:04:38,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179100601] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:04:38,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:04:38,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 14:04:38,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396813642] [2022-11-21 14:04:38,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:04:38,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 14:04:38,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:38,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 14:04:38,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 14:04:38,886 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 111 [2022-11-21 14:04:38,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 397 transitions, 2770 flow. Second operand has 6 states, 6 states have (on average 77.0) internal successors, (462), 6 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:38,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:04:38,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 111 [2022-11-21 14:04:38,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:04:43,625 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([496] L719-->L719-3: Formula: (= v_~s~0_22 (+ v_~s~0_23 1)) InVars {~s~0=v_~s~0_23} OutVars{thr1Thread3of3ForFork0_#t~post5#1=|v_thr1Thread3of3ForFork0_#t~post5#1_1|, ~s~0=v_~s~0_22} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~post5#1, ~s~0][288], [Black: 124#(and (= ~t~0 0) (= ~s~0 0)), Black: 126#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (<= 1 (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|))), Black: 125#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0)), 32#L719true, Black: 436#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 452#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 418#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 46#L717-8true, Black: 456#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 45#L719-3true, Black: 470#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 426#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 121#true, Black: 290#(not (= (mod ~c~0 4294967296) 1)), Black: 450#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 420#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 444#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), 424#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 448#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 430#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 280#(= (mod ~c~0 4294967296) 1), Black: 468#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 446#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 442#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0) (= (mod ~c~0 4294967296) 1)), Black: 462#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread1of3ForFork0InUse, Black: 422#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 454#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 434#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), thr1Thread2of3ForFork0InUse, 499#true, Black: 440#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 460#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread3of3ForFork0InUse, Black: 458#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 466#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 432#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 112#true, 4#L717-8true, Black: 464#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 117#(= ~c~0 1)]) [2022-11-21 14:04:43,625 INFO L383 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-11-21 14:04:43,625 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-21 14:04:43,625 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-21 14:04:43,626 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-21 14:04:44,466 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L719-->L719-3: Formula: (= v_~s~0_22 (+ v_~s~0_23 1)) InVars {~s~0=v_~s~0_23} OutVars{thr1Thread2of3ForFork0_#t~post5#1=|v_thr1Thread2of3ForFork0_#t~post5#1_1|, ~s~0=v_~s~0_22} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_#t~post5#1, ~s~0][184], [Black: 124#(and (= ~t~0 0) (= ~s~0 0)), Black: 126#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (<= 1 (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|))), Black: 125#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0)), 44#L719-3true, 47#L719-3true, Black: 436#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 452#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 418#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 456#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 470#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 426#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 121#true, Black: 290#(not (= (mod ~c~0 4294967296) 1)), Black: 450#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 420#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 444#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), 424#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 448#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 430#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 280#(= (mod ~c~0 4294967296) 1), Black: 468#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 446#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 442#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0) (= (mod ~c~0 4294967296) 1)), Black: 462#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread1of3ForFork0InUse, Black: 422#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 454#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 434#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), thr1Thread2of3ForFork0InUse, 499#true, Black: 440#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 460#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread3of3ForFork0InUse, Black: 458#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 466#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 432#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 112#true, 4#L717-8true, Black: 464#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 117#(= ~c~0 1), 55#L717-8true]) [2022-11-21 14:04:44,467 INFO L383 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-11-21 14:04:44,467 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-21 14:04:44,467 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-21 14:04:44,467 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-21 14:04:46,977 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([496] L719-->L719-3: Formula: (= v_~s~0_22 (+ v_~s~0_23 1)) InVars {~s~0=v_~s~0_23} OutVars{thr1Thread3of3ForFork0_#t~post5#1=|v_thr1Thread3of3ForFork0_#t~post5#1_1|, ~s~0=v_~s~0_22} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~post5#1, ~s~0][422], [Black: 124#(and (= ~t~0 0) (= ~s~0 0)), Black: 126#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (<= 1 (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|))), Black: 125#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0)), 32#L719true, 102#L717-7true, 290#(not (= (mod ~c~0 4294967296) 1)), 51#L716-3true, Black: 436#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 452#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 418#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 456#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 45#L719-3true, Black: 470#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 426#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 121#true, Black: 450#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 420#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 444#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 448#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 430#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 280#(= (mod ~c~0 4294967296) 1), Black: 468#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 446#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 424#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 442#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0) (= (mod ~c~0 4294967296) 1)), Black: 462#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread1of3ForFork0InUse, Black: 422#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 454#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 434#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), thr1Thread2of3ForFork0InUse, Black: 440#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), 499#true, Black: 460#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread3of3ForFork0InUse, Black: 458#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 466#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 432#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 464#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), 112#true, Black: 117#(= ~c~0 1)]) [2022-11-21 14:04:46,977 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-11-21 14:04:46,978 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-21 14:04:46,978 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-21 14:04:46,978 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-21 14:04:47,195 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([496] L719-->L719-3: Formula: (= v_~s~0_22 (+ v_~s~0_23 1)) InVars {~s~0=v_~s~0_23} OutVars{thr1Thread3of3ForFork0_#t~post5#1=|v_thr1Thread3of3ForFork0_#t~post5#1_1|, ~s~0=v_~s~0_22} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~post5#1, ~s~0][367], [Black: 124#(and (= ~t~0 0) (= ~s~0 0)), Black: 126#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (<= 1 (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|))), Black: 125#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0)), 44#L719-3true, 290#(not (= (mod ~c~0 4294967296) 1)), 51#L716-3true, Black: 436#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 452#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 418#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 456#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 45#L719-3true, Black: 470#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 426#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 121#true, Black: 450#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 420#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 444#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 448#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 430#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 280#(= (mod ~c~0 4294967296) 1), Black: 468#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 446#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 424#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 442#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0) (= (mod ~c~0 4294967296) 1)), Black: 462#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread1of3ForFork0InUse, Black: 422#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 454#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 434#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), thr1Thread2of3ForFork0InUse, 499#true, Black: 440#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 460#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread3of3ForFork0InUse, Black: 458#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 466#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 432#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 464#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), 112#true, 4#L717-8true, Black: 117#(= ~c~0 1)]) [2022-11-21 14:04:47,195 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-11-21 14:04:47,195 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-21 14:04:47,195 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-21 14:04:47,195 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-21 14:04:47,213 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([496] L719-->L719-3: Formula: (= v_~s~0_22 (+ v_~s~0_23 1)) InVars {~s~0=v_~s~0_23} OutVars{thr1Thread3of3ForFork0_#t~post5#1=|v_thr1Thread3of3ForFork0_#t~post5#1_1|, ~s~0=v_~s~0_22} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~post5#1, ~s~0][367], [Black: 124#(and (= ~t~0 0) (= ~s~0 0)), Black: 126#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (<= 1 (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|))), Black: 125#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0)), 44#L719-3true, 290#(not (= (mod ~c~0 4294967296) 1)), Black: 436#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 452#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 418#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 45#L719-3true, Black: 456#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 470#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 426#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 121#true, Black: 450#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 420#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 444#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 448#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 430#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 280#(= (mod ~c~0 4294967296) 1), Black: 468#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 446#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 424#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 442#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0) (= (mod ~c~0 4294967296) 1)), Black: 462#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread1of3ForFork0InUse, Black: 422#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 454#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 434#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), thr1Thread2of3ForFork0InUse, 499#true, Black: 440#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 460#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread3of3ForFork0InUse, Black: 458#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 466#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 432#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 112#true, Black: 464#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), 4#L717-8true, Black: 117#(= ~c~0 1), 93#thr1FINALtrue]) [2022-11-21 14:04:47,213 INFO L383 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-11-21 14:04:47,213 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-21 14:04:47,213 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-21 14:04:47,213 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-21 14:04:47,218 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([496] L719-->L719-3: Formula: (= v_~s~0_22 (+ v_~s~0_23 1)) InVars {~s~0=v_~s~0_23} OutVars{thr1Thread3of3ForFork0_#t~post5#1=|v_thr1Thread3of3ForFork0_#t~post5#1_1|, ~s~0=v_~s~0_22} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~post5#1, ~s~0][422], [Black: 124#(and (= ~t~0 0) (= ~s~0 0)), Black: 126#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (<= 1 (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|))), Black: 125#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0)), 32#L719true, 102#L717-7true, 290#(not (= (mod ~c~0 4294967296) 1)), Black: 436#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 452#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 418#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 45#L719-3true, Black: 456#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 470#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 426#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 121#true, Black: 450#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 420#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 444#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 448#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 430#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 280#(= (mod ~c~0 4294967296) 1), Black: 468#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 446#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 424#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 442#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0) (= (mod ~c~0 4294967296) 1)), Black: 462#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread1of3ForFork0InUse, Black: 422#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 454#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 434#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), thr1Thread2of3ForFork0InUse, 499#true, Black: 440#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 460#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread3of3ForFork0InUse, Black: 458#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 466#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 432#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 112#true, Black: 464#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 117#(= ~c~0 1), 93#thr1FINALtrue]) [2022-11-21 14:04:47,218 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-11-21 14:04:47,218 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-21 14:04:47,218 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-21 14:04:47,218 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-21 14:04:47,239 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([496] L719-->L719-3: Formula: (= v_~s~0_22 (+ v_~s~0_23 1)) InVars {~s~0=v_~s~0_23} OutVars{thr1Thread3of3ForFork0_#t~post5#1=|v_thr1Thread3of3ForFork0_#t~post5#1_1|, ~s~0=v_~s~0_22} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~post5#1, ~s~0][367], [Black: 124#(and (= ~t~0 0) (= ~s~0 0)), Black: 126#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (<= 1 (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|))), Black: 125#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0)), 44#L719-3true, 102#L717-7true, 290#(not (= (mod ~c~0 4294967296) 1)), Black: 436#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 452#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 418#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 45#L719-3true, Black: 456#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 470#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 426#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 121#true, Black: 450#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 420#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 444#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 448#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 430#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 280#(= (mod ~c~0 4294967296) 1), Black: 468#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 446#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 424#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 442#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0) (= (mod ~c~0 4294967296) 1)), Black: 462#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread1of3ForFork0InUse, Black: 422#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 454#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 434#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), thr1Thread2of3ForFork0InUse, 499#true, Black: 440#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 460#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread3of3ForFork0InUse, Black: 458#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 466#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 432#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 112#true, Black: 464#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 117#(= ~c~0 1), 93#thr1FINALtrue]) [2022-11-21 14:04:47,240 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-11-21 14:04:47,240 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-21 14:04:47,240 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-21 14:04:47,240 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-21 14:04:47,408 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([496] L719-->L719-3: Formula: (= v_~s~0_22 (+ v_~s~0_23 1)) InVars {~s~0=v_~s~0_23} OutVars{thr1Thread3of3ForFork0_#t~post5#1=|v_thr1Thread3of3ForFork0_#t~post5#1_1|, ~s~0=v_~s~0_22} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~post5#1, ~s~0][367], [Black: 124#(and (= ~t~0 0) (= ~s~0 0)), Black: 126#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (<= 1 (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|))), Black: 125#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0)), 44#L719-3true, 290#(not (= (mod ~c~0 4294967296) 1)), Black: 436#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 452#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 418#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 456#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 45#L719-3true, Black: 470#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 426#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 121#true, Black: 450#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 420#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 444#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 448#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 430#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 280#(= (mod ~c~0 4294967296) 1), Black: 468#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 446#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 424#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 442#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0) (= (mod ~c~0 4294967296) 1)), Black: 462#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread1of3ForFork0InUse, Black: 422#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 454#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 434#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), thr1Thread2of3ForFork0InUse, Black: 440#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), 499#true, Black: 460#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread3of3ForFork0InUse, Black: 458#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 466#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 432#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 112#true, 4#L717-8true, Black: 464#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 117#(= ~c~0 1), 93#thr1FINALtrue]) [2022-11-21 14:04:47,408 INFO L383 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-11-21 14:04:47,408 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-21 14:04:47,409 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-21 14:04:47,409 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-21 14:04:47,409 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-21 14:04:47,514 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([496] L719-->L719-3: Formula: (= v_~s~0_22 (+ v_~s~0_23 1)) InVars {~s~0=v_~s~0_23} OutVars{thr1Thread3of3ForFork0_#t~post5#1=|v_thr1Thread3of3ForFork0_#t~post5#1_1|, ~s~0=v_~s~0_22} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~post5#1, ~s~0][367], [Black: 124#(and (= ~t~0 0) (= ~s~0 0)), Black: 126#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (<= 1 (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|))), Black: 125#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0)), 44#L719-3true, 290#(not (= (mod ~c~0 4294967296) 1)), Black: 436#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 452#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 418#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 45#L719-3true, Black: 456#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 470#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 426#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 121#true, Black: 450#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 420#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 444#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 448#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 430#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 280#(= (mod ~c~0 4294967296) 1), Black: 468#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 446#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), 73#L718true, Black: 424#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 442#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0) (= (mod ~c~0 4294967296) 1)), Black: 462#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread1of3ForFork0InUse, Black: 422#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 454#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 434#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), thr1Thread2of3ForFork0InUse, 499#true, Black: 440#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 460#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread3of3ForFork0InUse, Black: 458#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 466#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 432#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 112#true, Black: 464#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 117#(= ~c~0 1), 93#thr1FINALtrue]) [2022-11-21 14:04:47,514 INFO L383 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-11-21 14:04:47,514 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-11-21 14:04:47,514 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-11-21 14:04:47,514 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-11-21 14:04:47,589 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([496] L719-->L719-3: Formula: (= v_~s~0_22 (+ v_~s~0_23 1)) InVars {~s~0=v_~s~0_23} OutVars{thr1Thread3of3ForFork0_#t~post5#1=|v_thr1Thread3of3ForFork0_#t~post5#1_1|, ~s~0=v_~s~0_22} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~post5#1, ~s~0][367], [Black: 124#(and (= ~t~0 0) (= ~s~0 0)), Black: 126#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (<= 1 (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|))), Black: 125#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0)), 44#L719-3true, 290#(not (= (mod ~c~0 4294967296) 1)), Black: 436#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 452#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 418#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 45#L719-3true, Black: 456#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 470#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 426#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 121#true, Black: 450#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), 23#L718-4true, Black: 420#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 444#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 448#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 430#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 280#(= (mod ~c~0 4294967296) 1), Black: 468#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 446#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 424#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 442#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0) (= (mod ~c~0 4294967296) 1)), Black: 462#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread1of3ForFork0InUse, Black: 422#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 454#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 434#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), thr1Thread2of3ForFork0InUse, 499#true, Black: 440#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 460#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread3of3ForFork0InUse, Black: 458#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 466#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 432#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 112#true, Black: 464#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 117#(= ~c~0 1), 93#thr1FINALtrue]) [2022-11-21 14:04:47,590 INFO L383 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-11-21 14:04:47,590 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-11-21 14:04:47,590 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-11-21 14:04:47,590 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-11-21 14:04:47,633 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([496] L719-->L719-3: Formula: (= v_~s~0_22 (+ v_~s~0_23 1)) InVars {~s~0=v_~s~0_23} OutVars{thr1Thread3of3ForFork0_#t~post5#1=|v_thr1Thread3of3ForFork0_#t~post5#1_1|, ~s~0=v_~s~0_22} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~post5#1, ~s~0][367], [Black: 124#(and (= ~t~0 0) (= ~s~0 0)), Black: 126#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (<= 1 (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|))), Black: 125#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0)), 44#L719-3true, 56#L719true, 290#(not (= (mod ~c~0 4294967296) 1)), Black: 436#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 452#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 418#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 456#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 45#L719-3true, Black: 470#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 426#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 121#true, Black: 450#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 420#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 444#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 448#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 430#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 280#(= (mod ~c~0 4294967296) 1), Black: 468#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 446#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 424#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 442#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0) (= (mod ~c~0 4294967296) 1)), Black: 462#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread1of3ForFork0InUse, Black: 422#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 454#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 434#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), thr1Thread2of3ForFork0InUse, Black: 440#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), 499#true, Black: 460#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread3of3ForFork0InUse, Black: 458#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 466#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 432#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 464#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), 112#true, Black: 117#(= ~c~0 1), 93#thr1FINALtrue]) [2022-11-21 14:04:47,634 INFO L383 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-11-21 14:04:47,634 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-21 14:04:47,634 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-21 14:04:47,634 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-21 14:04:48,027 INFO L130 PetriNetUnfolder]: 24861/52796 cut-off events. [2022-11-21 14:04:48,027 INFO L131 PetriNetUnfolder]: For 341329/352613 co-relation queries the response was YES. [2022-11-21 14:04:48,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213311 conditions, 52796 events. 24861/52796 cut-off events. For 341329/352613 co-relation queries the response was YES. Maximal size of possible extension queue 2503. Compared 592026 event pairs, 3662 based on Foata normal form. 347/49179 useless extension candidates. Maximal degree in co-relation 213272. Up to 20621 conditions per place. [2022-11-21 14:04:48,700 INFO L137 encePairwiseOnDemand]: 99/111 looper letters, 195 selfloop transitions, 76 changer transitions 0/440 dead transitions. [2022-11-21 14:04:48,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 440 transitions, 3644 flow [2022-11-21 14:04:48,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 14:04:48,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 14:04:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 540 transitions. [2022-11-21 14:04:48,703 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8108108108108109 [2022-11-21 14:04:48,703 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 540 transitions. [2022-11-21 14:04:48,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 540 transitions. [2022-11-21 14:04:48,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:04:48,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 540 transitions. [2022-11-21 14:04:48,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.0) internal successors, (540), 6 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:48,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:48,707 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:48,707 INFO L175 Difference]: Start difference. First operand has 176 places, 397 transitions, 2770 flow. Second operand 6 states and 540 transitions. [2022-11-21 14:04:48,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 440 transitions, 3644 flow [2022-11-21 14:04:53,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 440 transitions, 3236 flow, removed 145 selfloop flow, removed 8 redundant places. [2022-11-21 14:04:53,558 INFO L231 Difference]: Finished difference. Result has 174 places, 404 transitions, 2607 flow [2022-11-21 14:04:53,559 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2345, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2607, PETRI_PLACES=174, PETRI_TRANSITIONS=404} [2022-11-21 14:04:53,560 INFO L288 CegarLoopForPetriNet]: 109 programPoint places, 65 predicate places. [2022-11-21 14:04:53,560 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 404 transitions, 2607 flow [2022-11-21 14:04:53,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.0) internal successors, (462), 6 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:53,560 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:04:53,560 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:53,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 14:04:53,561 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 14:04:53,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:53,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1878497531, now seen corresponding path program 1 times [2022-11-21 14:04:53,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:53,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201223175] [2022-11-21 14:04:53,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:53,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 14:04:53,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 14:04:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 14:04:53,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 14:04:53,631 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 14:04:53,632 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2022-11-21 14:04:53,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-21 14:04:53,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-11-21 14:04:53,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-11-21 14:04:53,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-11-21 14:04:53,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-21 14:04:53,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 14:04:53,633 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-11-21 14:04:53,634 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-21 14:04:53,634 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-11-21 14:04:53,673 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 14:04:53,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 129 transitions, 290 flow [2022-11-21 14:04:53,713 INFO L130 PetriNetUnfolder]: 23/287 cut-off events. [2022-11-21 14:04:53,713 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-21 14:04:53,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 287 events. 23/287 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 899 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 237. Up to 10 conditions per place. [2022-11-21 14:04:53,715 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 129 transitions, 290 flow [2022-11-21 14:04:53,718 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 129 transitions, 290 flow [2022-11-21 14:04:53,719 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 14:04:53,725 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3e596997, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 14:04:53,725 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-21 14:04:53,729 INFO L130 PetriNetUnfolder]: 4/52 cut-off events. [2022-11-21 14:04:53,729 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 14:04:53,729 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:04:53,729 INFO L209 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] [2022-11-21 14:04:53,730 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-21 14:04:53,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:53,730 INFO L85 PathProgramCache]: Analyzing trace with hash 846339634, now seen corresponding path program 1 times [2022-11-21 14:04:53,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:53,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128546200] [2022-11-21 14:04:53,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:53,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:53,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:04:53,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:53,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128546200] [2022-11-21 14:04:53,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128546200] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:04:53,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:04:53,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 14:04:53,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486217434] [2022-11-21 14:04:53,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:04:53,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 14:04:53,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:53,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 14:04:53,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 14:04:53,749 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 129 [2022-11-21 14:04:53,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 129 transitions, 290 flow. Second operand has 2 states, 2 states have (on average 95.5) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:53,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:04:53,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 129 [2022-11-21 14:04:53,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:04:55,237 INFO L130 PetriNetUnfolder]: 5094/10988 cut-off events. [2022-11-21 14:04:55,238 INFO L131 PetriNetUnfolder]: For 755/755 co-relation queries the response was YES. [2022-11-21 14:04:55,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17853 conditions, 10988 events. 5094/10988 cut-off events. For 755/755 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 97153 event pairs, 3501 based on Foata normal form. 1903/10664 useless extension candidates. Maximal degree in co-relation 13547. Up to 6458 conditions per place. [2022-11-21 14:04:55,332 INFO L137 encePairwiseOnDemand]: 123/129 looper letters, 24 selfloop transitions, 0 changer transitions 0/118 dead transitions. [2022-11-21 14:04:55,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 118 transitions, 316 flow [2022-11-21 14:04:55,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 14:04:55,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-21 14:04:55,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 218 transitions. [2022-11-21 14:04:55,334 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8449612403100775 [2022-11-21 14:04:55,334 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 218 transitions. [2022-11-21 14:04:55,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 218 transitions. [2022-11-21 14:04:55,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:04:55,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 218 transitions. [2022-11-21 14:04:55,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 109.0) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:55,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:55,339 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:55,339 INFO L175 Difference]: Start difference. First operand has 127 places, 129 transitions, 290 flow. Second operand 2 states and 218 transitions. [2022-11-21 14:04:55,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 118 transitions, 316 flow [2022-11-21 14:04:55,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 118 transitions, 304 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-11-21 14:04:55,342 INFO L231 Difference]: Finished difference. Result has 123 places, 118 transitions, 256 flow [2022-11-21 14:04:55,343 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=256, PETRI_PLACES=123, PETRI_TRANSITIONS=118} [2022-11-21 14:04:55,344 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, -4 predicate places. [2022-11-21 14:04:55,344 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 118 transitions, 256 flow [2022-11-21 14:04:55,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 95.5) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:55,344 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:04:55,344 INFO L209 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] [2022-11-21 14:04:55,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 14:04:55,345 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-21 14:04:55,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:55,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1139084463, now seen corresponding path program 1 times [2022-11-21 14:04:55,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:55,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235976863] [2022-11-21 14:04:55,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:55,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:55,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:04:55,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:55,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235976863] [2022-11-21 14:04:55,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235976863] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:04:55,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:04:55,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 14:04:55,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467443449] [2022-11-21 14:04:55,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:04:55,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 14:04:55,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:55,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 14:04:55,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 14:04:55,410 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 129 [2022-11-21 14:04:55,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 118 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:55,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:04:55,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 129 [2022-11-21 14:04:55,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand